On the average degree of edge chromatic critical graphs. II.
From MaRDI portal
Publication:2200934
DOI10.1016/J.JCTB.2020.07.007zbMATH Open1448.05069OpenAlexW4214875510MaRDI QIDQ2200934FDOQ2200934
Authors: Yan Cao, Guantao Chen
Publication date: 24 September 2020
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2020.07.007
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
Cited In (16)
- Title not available (Why is that?)
- Edge coloring of graphs with small average degrees
- The average degree of edge chromatic critical graphs with maximum degree seven
- The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree
- Double Vizing fans in critical class two graphs
- The average degree of an edge‐chromatic critical graph II
- An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
- Average degrees of edge-chromatic critical graphs
- Title not available (Why is that?)
- On the size of critical graphs with small maximum degree
- Partitioning and coloring graphs with degree constraints
- A conclusion on the properties of edge-coloring critical graphs
- Degrees and degree sequence of \(k\)-edge \(d\)-critical graphs
- Title not available (Why is that?)
- The average degree of an edge-chromatic critical graph
- Erratum to: ``The average degree of an edge-chromatic critical graph. II.
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)