Colouring vertices of plane graphs under restrictions given by faces
DOI10.7151/DMGT.1462zbMATH Open1193.05065OpenAlexW2054460597MaRDI QIDQ3560780FDOQ3560780
Authors: Július Czap, Stanislav Jendroľ 
Publication date: 14 May 2010
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1e188a64c675f26f807458c763673af47fad7b4a
Recommendations
plane graphvertex colouringproper colouringLebesgue theoremstrong parity vertex colouringweak parity vertex colouring
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (28)
- A note on face coloring entire weightings of plane graphs
- Title not available (Why is that?)
- Weak-odd chromatic index of special digraph classes
- A survey on the cyclic coloring and its relaxations
- Notes on weak-odd edge colorings of digraphs
- Title not available (Why is that?)
- On some properties of 4‐regular plane graphs
- Facial packing vertex-coloring of subdivided plane graphs
- Parity vertex coloring of outerplane graphs
- Improved bounds for some facially constrained colorings
- Parity vertex colouring of plane graphs
- Colorability of planar graphs with isolated nontriangular faces
- An improved bound on parity vertex colourings of outerplane graphs
- Coloring face-hypergraphs of graphs on surfaces
- Facially-constrained colorings of plane graphs: a survey
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
- Facial list colourings of plane graphs
- Facial unique-maximum edge and total coloring of plane graphs
- Title not available (Why is that?)
- Maximum face-constrained coloring of plane graphs
- Coloring of plane graphs with unique maximal colors on faces
- Split Euler tours in 4-regular planar graphs
- Unique-maximum coloring of plane graphs
- Unique-maximum edge-colouring of plane graphs with respect to faces
- Coloring vertices and faces of locally planar graphs
- Title not available (Why is that?)
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
- Gaps in the chromatic spectrum of face-constrained plane graphs
This page was built for publication: Colouring vertices of plane graphs under restrictions given by faces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560780)
