Neighbourhood unions and Hamiltonian properties in graphs
From MaRDI portal
Publication:1123212
DOI10.1016/0095-8956(89)90060-9zbMath0677.05056OpenAlexW2003376008MaRDI QIDQ1123212
Michael S. Jacobson, Ronald J. Gould, Richard H. Schelp, Ralph J. Faudree
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90060-9
Related Items (36)
My Friend and Colleague, Richard Schelp ⋮ Neighborhood unions and Hamiltonian properties ⋮ Neighborhood unions and hamiltonicity of graphs ⋮ A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs ⋮ Neighborhood unions and \(Z_3\)-connectivity in graphs ⋮ Two new sufficient conditions for Hamilton-connected graphs ⋮ A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions ⋮ Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs ⋮ The neighborhood union of independent sets and hamiltonicity of graphs ⋮ Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle] ⋮ Neighborhood unions for the existence of disjoint chorded cycles in graphs ⋮ Neighborhood conditions for balanced independent sets in bipartite graphs ⋮ A neigborhood union condition for nonadjacent vertices in graphs ⋮ Leaf number and Hamiltonian \(C_4\)-free graphs ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ Neighborhood unions and extremal spanning trees ⋮ On a neighborhood condition implying the existence of disjoint complete graphs ⋮ Hamiltonism, degree sum and neighborhood intersections ⋮ Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Hamiltonian properties of graphs with large neighborhood unions ⋮ Hamiltonian-connected graphs ⋮ On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs ⋮ Neighborhood unions and a generalization of Dirac's theorem ⋮ Computation of the 0-dual closure for hamiltonian graphs ⋮ No-hole \((r+1)\)-distant colorings ⋮ One sufficient condition for Hamiltonian graphs involving distances ⋮ Unnamed Item ⋮ A generalization of Dirac's theorem for \(K(1,3)\)-free graphs ⋮ Neighborhood unions and cyclability of graphs ⋮ On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity ⋮ Neighborhood unions and factor critical graphs ⋮ Hamiltonian paths and hamiltonian connectivity in graphs ⋮ Four sufficient conditions for hamiltonian graphs ⋮ A generalization of Ore's Theorem involving neighborhood unions ⋮ Extremal problems and generalized degrees ⋮ Extending matchings in graphs: A survey
Cites Work
This page was built for publication: Neighbourhood unions and Hamiltonian properties in graphs
