Connected \([k,k+1]\)-factors of graphs

DOI10.1016/0012-365X(95)00328-TzbMath0879.05061OpenAlexW2051773042MaRDI QIDQ1357718

Mao-cheng Cai

Publication date: 16 June 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00328-t

zbMATH Keywords

matchingfactorsdegree conditionsconjecture of Kano

Mathematics Subject Classification ID

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

Related Items (6)

Graph factors and factorization: 1985--2003: a survey ⋮ Binding numbers and connected factors ⋮ Maximum fractional factors in graphs ⋮ Connected (g, f)-factors ⋮ The stability number and connected \([k,k+1\)-factor in graphs] ⋮ A \([k,k+1\)-factor containing a given Hamiltonian cycle]

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum degree of a graph and the existence of k-factors
• Graph factors
• An Ore-type condition for the existence of \(k\)-factors in graphs
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• A degree condition for the existence ofk-factors
• The Factors of Graphs

This page was built for publication: Connected \([k,k+1]\)-factors of graphs