Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle
From MaRDI portal
Publication:2400580
DOI10.1016/J.DISC.2016.09.026zbMATH Open1369.05128OpenAlexW2556088611MaRDI QIDQ2400580FDOQ2400580
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A neighbourhood condition for graphs to have \([a,b]\)-factors
- New sufficient conditions for cycles in graphs
- The Factors of Graphs
- Subgraphs with prescribed valencies
- Connected factors in graphs -- a survey
- Neighbourhood unions and Hamiltonian properties in graphs
- Hamiltonian properties of graphs with large neighborhood unions
- Neighborhood conditions and \(k\)-factors
- Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
- A degree condition for the existence ofk-factors
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
