Edge colorings of planar graphs without 5-cycles with two chords
From MaRDI portal
(Redirected from Publication:391789)
Recommendations
- Edge colorings of planar graphs without 6-cycles with three chords
- scientific article; zbMATH DE number 6945774
- Edge coloring of planar graphs without adjacent 7-cycles
- Edge colorings of planar graphs without adjacent special cycles.
- Edge coloring of planar graphs which any two short cycles are adjacent at most once
Cites work
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 1439502 (Why is no real title available?)
- A note on graphs of class I
- A sufficient condition for a planar graph to be class I
- A sufficient condition for a plane graph with maximum degree 6 to be class 1
- Edge colorings of graphs embeddable in a surface of low genus
- Edge-coloring critical graphs with high degree
- Every planar graph with maximum degree 7 is of class 1
- Planar graphs of maximum degree seven are Class I
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
Cited in
(18)- A survey on the cyclic coloring and its relaxations
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
- Planar graphs without chordal 5-cycles are 2-good
- Edge colorings of planar graphs without 6-cycles with three chords
- A sufficient condition for a planar graph to be of class 1
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- The edge colorings of \(K_5\)-minor free graphs
- Some sufficient conditions for 1-planar graphs to be class 1
- Edge coloring of planar graphs without adjacent 7-cycles
- Solution of Vizing's problem on interchanges for the case of graphs with maximum degree 4 and related results
- Edge colorings of planar graphs with maximum degree five.
- Edge colorings of planar graphs without adjacent special cycles.
- scientific article; zbMATH DE number 6178442 (Why is no real title available?)
- A sufficient condition for a planar graph of maximum degree five to be class 1
- A sufficient condition for a graph to be class 1
- Graph edge coloring: a survey
- Edge coloring of planar graphs which any two short cycles are adjacent at most once
- On edge colorings of 1-planar graphs without 5-cycles with two chords
This page was built for publication: Edge colorings of planar graphs without 5-cycles with two chords
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391789)