Parity vertex colouring of plane graphs
From MaRDI portal
Publication:626871
DOI10.1016/j.disc.2010.12.008zbMath1222.05051MaRDI QIDQ626871
Július Czap, Margit Voigt, Stanlislav Jendroľ
Publication date: 18 February 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.12.008
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Parity vertex coloring of outerplane graphs, Facial parity edge colouring of plane pseudographs, An improved bound on parity vertex colourings of outerplane graphs, Facially-constrained colorings of plane graphs: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Another step towards proving a conjecture by Plummer and Toft
- Optimal strong parity edge-coloring of complete graphs
- A new bound on the cyclic chromatic number
- Cyclic Chromatic Number of 3-Connected Plane Graphs
- Colouring vertices of plane graphs under restrictions given by faces
- A general upper bound for the cyclic chromatic number of 3‐connected plane graphs
- Cyclic coloration of 3-polytopes
- Every Planar Map is Four Colorable