A note on graphs of class I
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1135746
- Graphs of \(f\)-class 1
- A note on I-sets in graphs
- scientific article; zbMATH DE number 3235080
- scientific article; zbMATH DE number 811559
- A note on total graphs
- Class I graphs of nonnegative characteristic without special cycles
- A note on \(f\)-graphs
- scientific article; zbMATH DE number 1546840
Cited in
(21)- Edge coloring of planar graphs without adjacent 7-cycles
- Edge colorings of planar graphs without 6-cycles with three chords
- Graphs of \(f\)-class 1
- Strict neighbor-distinguishing total index of graphs
- A survey on the cyclic coloring and its relaxations
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
- Edge coloring of graphs embedded in a surface of nonnegative characteristic
- Bounds on directed star arboricity in some digraph classes
- 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
- A note on class one graphs with maximum degree six
- Face-degree bounds for planar critical graphs
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- Class I graphs of nonnegative characteristic without special cycles
- 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
- scientific article; zbMATH DE number 1135746 (Why is no real title available?)
- scientific article; zbMATH DE number 1159503 (Why is no real title available?)
- scientific article; zbMATH DE number 1990720 (Why is no real title available?)
- The strong chromatic index of 1-planar graphs
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
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)