Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree

DOI10.1002/JGT.3190140211MaRDI QIDQ3483313zbMATH OpenOpenAlexFDO

Authors Thomas Niessen, Lutz Volkmann

Publication date 1990

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190140211

zbMATH Keywords

regular graphsClass 1l-factorization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• Publication:4862898
• Two conjectures on edge-colouring
• Some criteria for a graph to be class 1
• scientific article; zbMATH DE number 1135746
• scientific article; zbMATH DE number 1990720

Cited in

(29)

• Recent results on the total chromatic number
• Edge-colouring of joins of regular graphs. I
• The number of disjoint perfect matchings in semi-regular graphs
• Some new results in the Alcuin number of graphs
• scientific article; zbMATH DE number 3885932 (Why is no real title available?)
• Class one graphs
• scientific article; zbMATH DE number 840690 (Why is no real title available?)
• scientific article; zbMATH DE number 3893226 (Why is no real title available?)
• Regular factors of simple regular graphs and factor-spectra
• Sufficient conditions for a graph to be edge-colorable with maximum degree colors
• Totally critical even order graphs
• On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
• A \(\Delta\)-subgraph condition for a graph to be class 1
• Two conjectures on edge-colouring
• Graph divisible designs and packing constructions
• Matching divisible designs with block size four
• Edge-colouring of regular graphs of large degree
• Minimal edge colorings of class 2 graphs and double graphs
• How to find overfull subgraphs in graphs with large maximum degree
• Graph factors and factorization: 1985--2003: a survey
• The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
• The chromatic index of graphs of high maximum degree
• Latin hexahedra and related combinatorial structures
• scientific article; zbMATH DE number 3946161 (Why is no real title available?)
• scientific article; zbMATH DE number 3908457 (Why is no real title available?)
• Vertex-splitting and chromatic index critical graphs
• An application of Tutte's theorem to 1-factorization of regular graphs of high degree
• scientific article; zbMATH DE number 3963864 (Why is no real title available?)
• Edge-colouring of join graphs

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)