On the average degree of critical graphs with maximum degree six
From MaRDI portal
Publication:409377
Recommendations
- The size of edge chromatic critical graphs with maximum degree 6
- The average degree of an edge-chromatic critical graph
- On the average degree of edge chromatic critical graphs
- On Gallai's conjecture for graphs with maximum degree 6
- Average degrees of edge-chromatic critical graphs
- Maximum average degree of list-edge-critical graphs and Vizing's conjecture
- scientific article; zbMATH DE number 5613296
- The average degree of edge chromatic critical graphs with maximum degree seven
- The average degree of a subcubic edge-chromatic critical graph
- scientific article; zbMATH DE number 5279355
Cites work
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- Every planar graph with maximum degree 7 is of class 1
- On critical graphs with chromatic index 4
- On small graphs critical with respect to edge colourings
- On the size of edge-chromatic critical graphs
- Planar graphs of maximum degree seven are Class I
- The average degree of an edge-chromatic critical graph
- The size of edge chromatic critical graphs with maximum degree 6
Cited in
(8)- The average degree of a multigraph critical with respect to edge or total choosability
- Size of critical graphs with maximum degree eight
- scientific article; zbMATH DE number 2192190 (Why is no real title available?)
- Graph edge coloring: a survey
- On the maximum degree of \(3_t\)-critical graphs
- A better lower bound on average degree of 4-list-critical graphs
- scientific article; zbMATH DE number 5613296 (Why is no real title available?)
- The spectral radius of edge chromatic critical graphs
This page was built for publication: On the average degree of critical graphs with maximum degree six
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409377)