Improved bound on facial parity edge coloring

DOI10.1016/J.DISC.2013.05.022zbMath1281.05063arXiv1303.4593OpenAlexW2029146024MaRDI QIDQ390304

Riste Škrekovski, Borut Lužar

Publication date: 23 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.4593

zbMATH Keywords

plane graphfacial parity edge coloringodd graph

Mathematics Subject Classification ID

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

Related Items (8)

Odd facial colorings of acyclic plane graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ On vertex-parity edge-colorings ⋮ A survey on the cyclic coloring and its relaxations ⋮ Facial edge ranking of plane graphs ⋮ Facial parity 9-edge-coloring of outerplane graphs ⋮ Unique-maximum edge-colouring of plane graphs with respect to faces ⋮ Improved bounds for some facially constrained colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Facial parity edge colouring of plane pseudographs
• Optimal strong parity edge-coloring of complete graphs
• Facial parity edge colouring
• On the eulericity of a graph
• Facial parity edge coloring of outerplane graphs

This page was built for publication: Improved bound on facial parity edge coloring