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

DOI10.1002/JGT.3190140211zbMath0704.05041OpenAlexW2037568604MaRDI QIDQ3483313

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)

Related Items (17)

The number of disjoint perfect matchings in semi-regular graphs ⋮ How to find overfull subgraphs in graphs with large maximum degree ⋮ Edge-colouring of join graphs ⋮ The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) ⋮ Edge-colouring of joins of regular graphs. I ⋮ The chromatic index of graphs of high maximum degree ⋮ Vertex-splitting and chromatic index critical graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs ⋮ Graph divisible designs and packing constructions ⋮ Matching divisible designs with block size four ⋮ Latin hexahedra and related combinatorial structures ⋮ Edge-colouring of regular graphs of large degree ⋮ Recent results on the total chromatic number ⋮ An application of Tutte's theorem to 1-factorization of regular graphs of high degree ⋮ Regular factors of simple regular graphs and factor-spectra ⋮ Totally critical even order graphs

This page was built for publication: Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree