Regular factors of simple regular graphs and factor-spectra

DOI10.1016/S0012-365X(97)00166-0zbMath0958.05114MaRDI QIDQ1584246

Thomas Niessen, Bert Randerath

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge-connectivity\(k\)-factor\(k\)-spectrasimple \(r\)-regular graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Graph factors and factorization: 1985--2003: a survey, Unnamed Item, Cut-edges and regular factors in regular graphs of odd degree, Matching and edge-connectivity in regular graphs, Regular factors and eigenvalues of regular graphs, Eigenvalues and [a,b‐factors in regular graphs], Sufficient conditions for graphs to have strong parity factors, Ramsey Equivalence for Asymmetric Pairs of Graphs, Well-covered graphs and factors

Cites Work

• Unnamed Item
• 1-factorizing regular graphs of high degree - an improved bound
• The spectrum of maximal sets of one-factors
• Maximal sets of 2-factors and Hamiltonian cycles
• Regular graphs, regular factors, and the impact of Petersen's theorems
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• Regular factors of regular graphs
• Factorizations of regular graphs of high degree
• Existence of k-edge connected ordinary graphs with prescribed degrees
• On factorisation of graphs
• Reguläre Faktoren von Graphen.
• The Factors of Graphs