Facial parity edge colouring of plane pseudographs
From MaRDI portal
Publication:442406
DOI10.1016/j.disc.2012.03.036zbMath1245.05044OpenAlexW2024733865MaRDI 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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (10)
Odd facial colorings of acyclic plane graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Notes on weak-odd edge colorings of digraphs ⋮ Improved bound on facial parity edge coloring ⋮ On vertex-parity edge-colorings ⋮ A survey on the cyclic coloring and its relaxations ⋮ Facial parity 9-edge-coloring of outerplane graphs ⋮ Unique-maximum edge-colouring of plane graphs with respect to faces ⋮ Weak-odd chromatic index of special digraph classes ⋮ Improved bounds for some facially constrained colorings
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
This page was built for publication: Facial parity edge colouring of plane pseudographs
