Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles.
From MaRDI portal
Publication:3134305
zbMATH Open1463.05170MaRDI QIDQ3134305FDOQ3134305
Authors: Jing Jin, Baogang Xu 
Publication date: 9 February 2018
Recommendations
- On edge colorings of 1-planar graphs without 5-cycles with two chords
- On edge colorings of 1-planar graphs without chordal 5-cycles.
- On edge colorings of 1-planar graphs without adjacent triangles
- On edge colorings of 1-planar graphs with 6-cycles having at most three chords
- On edge colorings of \(1\)-planar graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (10)
- On edge colorings of 1-planar graphs without chordal 5-cycles.
- On edge colorings of \(1\)-planar graphs
- Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.
- The edge chromatic number of outer-1-planar graphs
- A sufficient condition for an IC-planar graph to be of class 1
- On edge colorings of 1-planar graphs without adjacent triangles
- On edge colorings of 1-planar graphs with 6-cycles having at most three chords
- On partitioning the edges of 1-plane graphs
- Graph edge coloring: a survey
- On edge colorings of 1-planar graphs without 5-cycles with two chords
This page was built for publication: Edge coloring of \(1\)-planar graphs without intersecting triangles and chordal \(5\)-cycles.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134305)
