Strong parity vertex coloring of plane graphs

MaRDI QIDQ5413907zbMATH OpenFDO

Authors Tomáš Kaiser, Ondřej Rucký, Matěj Stehlík, Riste Škrekovski

Publication date 2 May 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1796/0.html

zbMATH Keywords

dischargingfaceproper coloringstrong parity chromatic numberstrong parity vertex coloring

Mathematics Subject Classification ID

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

Recommendations

• On the strong parity chromatic number
• Parity vertex colouring of plane graphs
• Parity vertex coloring of outerplane graphs
• An improved bound on parity vertex colourings of outerplane graphs
• Facial parity edge colouring

Cited in

(13)

• Optimal strong parity edge-coloring of complete graphs
• On vertex-parity edge-colorings
• Parity and strong parity edge-colorings of graphs
• A characterization for graphs having strong parity factors
• Improved bounds for some facially constrained colorings
• A survey on the cyclic coloring and its relaxations
• Facially-constrained colorings of plane graphs: a survey
• On the strong parity chromatic number
• Parity vertex coloring of outerplane graphs
• An improved bound on parity vertex colourings of outerplane graphs
• Odd facial colorings of acyclic plane graphs
• Parity vertex colouring of plane graphs
• On strong odd colorings of graphs

This page was built for publication: Strong parity vertex coloring of plane graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5413907)