Edge-coloring of plane multigraphs with many colors on facial cycles
From MaRDI portal
Publication:2185732
DOI10.1016/j.dam.2019.11.003zbMath1462.05135OpenAlexW2990704544WikidataQ126782795 ScholiaQ126782795MaRDI QIDQ2185732
Július Czap, Juraj Valiska, Stanlislav Jendroľ
Publication date: 5 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.11.003
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On \(r\)-acyclic edge colorings of planar graphs
- Colouring edges with many colours in cycles
- Generalised acyclic edge colourings of graphs with large girth
- Further result on acyclic chromatic index of planar graphs
- Generalized arboricity of graphs with large girth
- Generalized acyclic edge colorings via entropy compression
- Facially-constrained colorings of plane graphs: a survey
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
- Facial list colourings of plane graphs
- On the total coloring of planar graphs.
- Acyclic coloring of graphs
- Every planar map is four colorable
- On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring
- Decomposition of Finite Graphs Into Forests
- A Theorem on Coloring the Lines of a Network
