A note on Hamiltonian cycles in \((k,n)\)-factor-critical graphs
From MaRDI portal
Publication:2716867
zbMATH Open0981.05068MaRDI QIDQ2716867
Publication date: 2 December 2001
Published in: SUT Journal of Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
Hamiltonian ?-factors in graphs ⋮ A note on hamiltonian cycles in \(K_{1,r}\)-free graphs ⋮ A \([k,k+1\)-factor containing a given Hamiltonian cycle] ⋮ A \([k,k+1\)-factor containing a given Hamiltonian cycle]
This page was built for publication: A note on Hamiltonian cycles in \((k,n)\)-factor-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2716867)
