Facial rainbow edge-coloring of simple 3-connected plane graphs
From MaRDI portal
Publication:3298111
DOI10.7494/OpMath.2020.40.4.475zbMath1444.05056OpenAlexW3041706799MaRDI QIDQ3298111
Publication date: 21 July 2020
Published in: Opuscula Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7494/opmath.2020.40.4.475
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge coloring of planar graphs which any two short cycles are adjacent at most once
- Edge colorings of planar graphs without 5-cycles with two chords
- Planar graphs of maximum degree six without 7-cycles are class one
- On the chromatic index of almost all graphs
- Edge coloring of planar graphs without adjacent 7-cycles
- Graph edge coloring: a survey
- A sufficient condition for a plane graph with maximum degree 6 to be class 1
- Planar graphs of maximum degree seven are Class I
- A note on graphs of class I
- Facially-constrained colorings of plane graphs: a survey
- Facial rainbow edge-coloring of plane graphs
- Facial \([r,s,t\)-colorings of plane graphs]
- A sufficient condition for a planar graph to be class I
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
- On the planarity of regular incidence sequences
- Realization spaces of polytopes
- Recursive generation of simple planar 5-regular graphs and pentangulations
- The NP-Completeness of Edge-Coloring
- Every planar graph with maximum degree 7 is of class 1
This page was built for publication: Facial rainbow edge-coloring of simple 3-connected plane graphs