On the average degree of edge chromatic critical graphs. II.
From MaRDI portal
Publication:2200934
Recommendations
Cites work
Cited in
(18)- An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
- Edge coloring of graphs with small average degrees
- Partitioning and coloring graphs with degree constraints
- Average degrees of edge-chromatic critical graphs
- On the average degree of edge chromatic critical graphs
- The average degree of an edge-chromatic critical graph
- Degrees and degree sequence of k-edge d-critical graphs
- On the size of critical graphs with small maximum degree
- Erratum to: ``The average degree of an edge-chromatic critical graph. II.
- A conclusion on the properties of edge-coloring critical graphs
- scientific article; zbMATH DE number 1839783 (Why is no real title available?)
- scientific article; zbMATH DE number 5279355 (Why is no real title available?)
- The average degree of an edge‐chromatic critical graph II
- scientific article; zbMATH DE number 2192190 (Why is no real title available?)
- The overfullness of graphs with small minimum degree and large maximum degree
- Double Vizing fans in critical class two graphs
- On the density of critical graphs with no large cliques
- The average degree of edge chromatic critical graphs with maximum degree seven
This page was built for publication: On the average degree of edge chromatic critical graphs. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200934)