Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle

DOI10.1016/J.DISC.2016.09.026MaRDI QIDQ2400580zbMATH OpenOpenAlexFDO

Authors Michitaka Furuya, Takamasa Yashima

Publication date 29 August 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2016.09.026

zbMATH Keywords

Hamiltonian cycle\([a, b\)-factor]neighborhood-union condition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
• scientific article; zbMATH DE number 5953644
• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• scientific article; zbMATH DE number 1501177
• scientific article; zbMATH DE number 1910915

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1117461 (Why is no real title available?)
• scientific article; zbMATH DE number 1833096 (Why is no real title available?)
• A degree condition for the existence ofk-factors
• A neighbourhood condition for graphs to have \([a,b]\)-factors
• Connected factors in graphs -- a survey
• Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
• Graph theory
• Hamiltonian properties of graphs with large neighborhood unions
• Neighborhood conditions and k-factors
• Neighbourhood unions and Hamiltonian properties in graphs
• New sufficient conditions for cycles in graphs
• Subgraphs with prescribed valencies
• The Factors of Graphs

Cited in

(5)

• Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
• Neighborhood union conditions for fractional \([a, b]\)-covered graphs
• Path factors and neighborhoods of independent sets in graphs
• A degree condition for fractional \([a,b]\)-covered graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

This page was built for publication: Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle

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