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

DOI10.1002/JGT.3190060413zbMATH Open0506.05048OpenAlexW2137937061MaRDI QIDQ4742822FDOQ4742822

Authors: 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

Hamiltonian cycle1-factordegree-condition

Mathematics Subject Classification ID

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

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742822)