Parity vertex colouring of plane graphs

DOI10.1016/j.disc.2010.12.008zbMath1222.05051OpenAlexW1986731394MaRDI QIDQ626871

Margit Voigt, Július Czap, 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

zbMATH Keywords

plane graphvertex colouringdischarging methodparity vertex colouring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Odd facial colorings of acyclic plane graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Parity vertex coloring of outerplane graphs ⋮ Facial parity edge colouring of plane pseudographs ⋮ An improved bound on parity vertex colourings of outerplane graphs ⋮ A survey on the cyclic coloring and its relaxations ⋮ Improved bounds for some facially constrained colorings

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parity vertex colouring of plane graphs