A note on graphs of class I
From MaRDI portal
Recommendations
Cited in
(18)- Edge colorings of planar graphs without 5-cycles with two chords
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
- Edge coloring of graphs embedded in a surface of nonnegative characteristic
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
- Class I graphs of nonnegative characteristic without special cycles
- Edge coloring of planar graphs which any two short cycles are adjacent at most once
- A note on class one graphs with maximum degree six
- Face-degree bounds for planar critical graphs
- Bounds on directed star arboricity in some digraph classes
- Strict neighbor-distinguishing total index of graphs
- Edge colorings of planar graphs without 6-cycles with three chords
- scientific article; zbMATH DE number 1990720 (Why is no real title available?)
- Graphs of \(f\)-class 1
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- A survey on the cyclic coloring and its relaxations
- Edge coloring of planar graphs without adjacent 7-cycles
- A sufficient condition for a planar graph to be class I
This page was built for publication: A note on graphs of class I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869228)