A degree condition for the existence of 1-factors in graphs or their complements

DOI10.1016/S0012-365X(99)00011-4zbMath0934.05107OpenAlexW2051748093MaRDI QIDQ1301648

Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura

Publication date: 10 April 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00011-4

zbMATH Keywords

irregularity1-factorminimum degree

Mathematics Subject Classification ID

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

Related Items (2)

An odd \([ 1 , b \)-factor in regular graphs from eigenvalues] ⋮ Eigenvalues and [a,b‐factors in regular graphs]

Cites Work

• Unnamed Item
• Factors and factorizations of graphs—a survey
• The Factorization of Linear Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: A degree condition for the existence of 1-factors in graphs or their complements