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

DOI10.1016/J.DISC.2016.09.026zbMath1369.05128OpenAlexW2556088611MaRDI QIDQ2400580

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)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New sufficient conditions for cycles in graphs
• Neighbourhood unions and Hamiltonian properties in graphs
• Hamiltonian properties of graphs with large neighborhood unions
• Neighborhood conditions and \(k\)-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]
• A degree condition for the existence ofk-factors
• Subgraphs with prescribed valencies
• The Factors of Graphs

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