Edge-coloring of plane graphs with many colors on faces
From MaRDI portal
Publication:6621184
Authors: Július Czap, Stanislav Jendroľ, Juraj Valiska
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
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
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
- Acyclic coloring of graphs
- Generalised acyclic edge colourings of graphs with large girth
- Topological graph theory.
- On \(r\)-acyclic edge colorings of planar graphs
- Colouring edges with many colours in cycles
- On the algorithmic Lovász local lemma and acyclic edge coloring
- Further result on acyclic chromatic index of planar graphs
- Facially-constrained colorings of plane graphs: a survey
- Facial list colourings of plane graphs
- Generalized arboricity of graphs with large girth
- Generalized acyclic edge colorings via entropy compression
- On an estimate of the chromatic class of a \(p\)-graph
Cited In (1)
This page was built for publication: Edge-coloring of plane graphs with many colors on faces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621184)