scientific article; zbMATH DE number 5953644

MaRDI QIDQ3171797zbMATH OpenFDO

Authors Bing-Yuan Pu, Sizhong Zhou

Publication date 5 October 2011

zbMATH Keywords

Hamiltonian cycleHamiltonian factorHamiltonian graph

Mathematics Subject Classification ID

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

Recommendations

• Independence number and minimum degree for \([a,b]\)-factors
• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• scientific article; zbMATH DE number 1833096
• A degree condition for graphs to have Hamiltonian (g,f)-factors
• Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
• Degree condition for the existence of a k-factor containing a given Hamiltonian cycle
• scientific article; zbMATH DE number 500491
• Hamiltonian properties and the bipartite independence number
• Hamiltonicity, minimum degree and leaf number
• Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs

Cited in

(9)

• Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
• Stability number and \(k\)-Hamiltonian \([a,b]\)-factors
• A degree condition for graphs to have Hamiltonian (g,f)-factors
• Toughness for the existence of \(k\)-Hamiltonian \([a,b]\)-factors.
• On ID-Hamiltonian \([a,b]\)-factor
• A sufficient condition for graphs to have ID-Hamiltonian \([a,b]\)-factors
• An existence theorem on Hamiltonian (g,f)-factors in networks

This page was built for publication:

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