Facial parity edge colouring of plane pseudographs
From MaRDI portal
Publication:442406
DOI10.1016/J.DISC.2012.03.036zbMATH Open1245.05044OpenAlexW2024733865MaRDI QIDQ442406FDOQ442406
Authors: Július Czap, František Kardoš, Roman Soták, Stanislav 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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- Decomposition of Finite Graphs Into Forests
- The four-colour theorem
- Every planar map is four colorable
- Planar graphs of maximum degree seven are Class I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal strong parity edge-coloring of complete graphs
- Title not available (Why is that?)
- Facial parity edge colouring
- Title not available (Why is that?)
- Parity vertex coloring of outerplane graphs
- Parity vertex colouring of plane graphs
- Edge partition of planar sraphs into two outerplanar graphs
- Covering the edges of a graph by three odd subgraphs
Cited In (19)
- Weak-odd chromatic index of special digraph classes
- A survey on the cyclic coloring and its relaxations
- Notes on weak-odd edge colorings of digraphs
- Improved bounds for some facially constrained colorings
- Decompositions of plane graphs under parity constrains given by faces
- Facial entire colouring of plane graphs
- On the strong parity chromatic number
- Facially-constrained colorings of plane graphs: a survey
- Facial packing edge-coloring of plane graphs
- Edge-coloring of plane multigraphs with many colors on facial cycles
- Edge looseness of plane graphs
- Facial parity edge colouring
- On vertex-parity edge-colorings
- Facial visibility in edge colored plane graphs
- Facial parity 9-edge-coloring of outerplane graphs
- Unique-maximum edge-colouring of plane graphs with respect to faces
- Odd facial colorings of acyclic plane graphs
- Facial parity edge coloring of outerplane graphs
- Improved bound on facial parity edge coloring
This page was built for publication: Facial parity edge colouring of plane pseudographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442406)