Facial parity edge colouring of plane pseudographs

DOI10.1016/j.disc.2012.03.036zbMath1245.05044MaRDI QIDQ442406

Roman Soták, Július Czap, František Kardoš, Stanlislav Jendroľ

Publication date: 10 August 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.036

zbMATH Keywords

plane graph; edge colouring; facial walk

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

Odd facial colorings of acyclic plane graphs, Notes on weak-odd edge colorings of digraphs, Improved bound on facial parity edge coloring, Facial parity 9-edge-coloring of outerplane graphs, On vertex-parity edge-colorings, Weak-odd chromatic index of special digraph classes, Improved bounds for some facially constrained colorings, A survey on the cyclic coloring and its relaxations, Unique-maximum edge-colouring of plane graphs with respect to faces, Facially-constrained colorings of plane graphs: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parity vertex coloring of outerplane graphs
• Parity vertex colouring of plane graphs
• Optimal strong parity edge-coloring of complete graphs
• The four-colour theorem
• Planar graphs of maximum degree seven are Class I
• Facial parity edge colouring
• Edge partition of planar sraphs into two outerplanar graphs
• Every planar map is four colorable
• Covering the edges of a graph by three odd subgraphs
• Decomposition of Finite Graphs Into Forests