Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
From MaRDI portal
Publication:3483313
Recommendations
Cited in
(33)- An application of Tutte's theorem to 1-factorization of regular graphs of high degree
- A \(\Delta\)-subgraph condition for a graph to be class 1
- Class one graphs
- Two conjectures on edge-colouring
- On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
- Totally critical even order graphs
- How to find overfull subgraphs in graphs with large maximum degree
- The chromatic index of graphs of high maximum degree
- Vertex-splitting and chromatic index critical graphs
- Coloring edges of self-complementary graphs
- Regular factors of simple regular graphs and factor-spectra
- The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
- Edge-colouring of join graphs
- Edge-colouring of regular graphs of large degree
- Minimal edge colorings of class 2 graphs and double graphs
- scientific article; zbMATH DE number 3885932 (Why is no real title available?)
- Sufficient conditions for a graph to be edge-colorable with maximum degree colors
- scientific article; zbMATH DE number 3908457 (Why is no real title available?)
- scientific article; zbMATH DE number 3946161 (Why is no real title available?)
- scientific article; zbMATH DE number 3963864 (Why is no real title available?)
- 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 840690 (Why is no real title available?)
- The number of disjoint perfect matchings in semi-regular graphs
- scientific article; zbMATH DE number 3893226 (Why is no real title available?)
- Some new results in the Alcuin number of graphs
- Latin hexahedra and related combinatorial structures
- Recent results on the total chromatic number
- A sufficient condition for complete multipartite graphs to be of type 1
- Edge-colouring of joins of regular graphs. I
- Graph factors and factorization: 1985--2003: a survey
- Graph divisible designs and packing constructions
- Matching divisible designs with block size four
This page was built for publication: Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3483313)
