Precoloring extension in planar near-Eulerian-triangulations

We consider the 4-precoloring extension problem in planar near-Eulerian- triangulations , i.e., plane graphs where all faces except possibly for the outer one have length three, all vertices not incident with the outer face have even degree, and exactly the vertices incident with the outer face are precolored. We give a necessary topological condition for the precoloring to extend, and give a complete characterization when the outer face has length at most five and when all vertices of the outer face have odd degree and are colored using only three colors.

Authors

Institutions

Publication Details

Journal
European Journal of Combinatorics
Published
2025-03-07
DOI
https://doi.org/10.1016/j.ejc.2025.104138
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Precoloring extension in planar near-Eulerian-triangulations

Benjamin R. Moore, Michaela Seifrtová, Zdenĕk Dvořák, Robert Šámal
European Journal of Combinatorics
Graph Labeling and Dimension Problems
article

Precoloring extension in planar near-Eulerian-triangulations

Benjamin R. Moore, Michaela Seifrtová, Zdenĕk Dvořák, Robert Šámal
article en

Abstract

We consider the 4-precoloring extension problem in planar near-Eulerian- triangulations , i.e., plane graphs where all faces except possibly for the outer one have length three, all vertices not incident with the outer face have even degree, and exactly the vertices incident with the outer face are precolored. We give a necessary topological condition for the precoloring to extend, and give a complete characterization when the outer face has length at most five and when all vertices of the outer face have odd degree and are colored using only three colors.

European Journal of CombinatoricsVol. 127
Charles University (CZ)
Grantová Agentura České Republiky
Climate action
Openalex Percentile: Top 95%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.