A sufficient condition for a graph to contain three disjoint 1-factors

DOI10.1002/JGT.3190060413zbMath0506.05048OpenAlexW2137937061MaRDI QIDQ4742822

Sein Win

Publication date: 1982

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

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

zbMATH Keywords

1-factorHamiltonian cycledegree-condition

Mathematics Subject Classification ID

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

Related Items (2)

Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ A sufficient condition for a graph to contain two disjoint Hamiltonian cycles

This page was built for publication: A sufficient condition for a graph to contain three disjoint 1-factors