On edge colorings of 1-planar graphs without chordal 5-cycles.
From MaRDI portal
Publication:4909715
Recommendations
- On edge colorings of 1-planar graphs without 5-cycles with two chords
- Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles.
- Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.
- On edge colorings of 1-planar graphs with 6-cycles having at most three chords
- Edge colorings of planar graphs with maximum degree five.
Cited in
(21)- On edge colorings of 1-planar graphs without 5-cycles with two chords
- Graph edge coloring: a survey
- Light subgraphs in the family of 1-planar graphs with high minimum degree
- 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
- On total colorings of 1-planar graphs
- An annotated bibliography on 1-planarity
- Edge colorings of planar graphs with maximum degree five.
- Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.
- Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles.
- The coloring of the class of 1-planar graphs and its subclasses
- On edge colorings of 1-planar graphs with 6-cycles having at most three chords
- On edge colorings of 1-toroidal graphs
- On edge colorings of 1-planar graphs without adjacent triangles
- Some sufficient conditions for 1-planar graphs to be class 1
- A sufficient condition for an IC-planar graph to be of class 1
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
- Note on improper coloring of 1-planar graphs.
- 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
- On (p,1)-total labelling of 1-planar graphs
- List edge and list total coloring of 1-planar graphs
- The edge chromatic number of outer-1-planar graphs
This page was built for publication: On edge colorings of 1-planar graphs without chordal 5-cycles.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909715)
