scientific article; zbMATH DE number 5953644
From MaRDI portal
Publication:3171797
zbMATH Open1235.05117MaRDI QIDQ3171797FDOQ3171797
Authors: Bing-Yuan Pu, Sizhong Zhou 
Publication date: 5 October 2011
Title of this publication is not available (Why is that?)
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
Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (9)
- Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
- On ID-Hamiltonian \([a,b]\)-factor
- A sufficient condition for graphs to have ID-Hamiltonian \([a,b]\)-factors
- Toughness for the existence of \(k\)-Hamiltonian \([a,b]\)-factors.
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
- An existence theorem on Hamiltonian \((g,f)\)-factors in networks
- Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
- A degree condition for graphs to have Hamiltonian \((g,f)\)-factors
- Stability number and \(k\)-Hamiltonian \([a,b]\)-factors
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)
