Independence trees and Hamilton cycles

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-W" /><227::AID-JGT2>3.0.CO;2-W 10.1002/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-WzbMath0919.05017OpenAlexW4239638204MaRDI QIDQ4242952

Hilde Tuinstra, Hajo J. Broersma

Publication date: 11 May 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199812)29:4<227::aid-jgt2>3.0.co;2-w

zbMATH Keywords

independent setspanning treeHamilton cycleindependence tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (36)

A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph ⋮ Spanning \(k\)-ended trees of bipartite graphs ⋮ Spectral radius and spanning trees of graphs ⋮ A note on spanning trees with a specified degree sequence ⋮ A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph ⋮ Spanning trees homeomorphic to a small tree ⋮ Progress on sufficient conditions for a graph to have a spanning \(k\)-ended tree ⋮ Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs ⋮ Spanning trees with small degrees and few leaves ⋮ A note on computing graph closures ⋮ Spanning trees: A survey ⋮ Spanning \(k\)-trees of \(n\)-connected graphs ⋮ Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs ⋮ Degree conditions for graphs to have spanning trees with few branch vertices and leaves ⋮ Spanning trees with few peripheral branch vertices ⋮ Spanning trees with few leaves ⋮ Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves ⋮ Spanning 5-ended trees in \(K_{1,5}\)-free graphs ⋮ On a spanning tree with specified leaves ⋮ Number of vertices of degree three in spanning 3-trees in square graphs ⋮ On spanning trees with few branch vertices ⋮ On 3-stable number conditions in \(n\)-connected claw-free graphs ⋮ Spanning trees with a bounded number of leaves ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ Spanning trees whose reducible stems have a few branch vertices ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ Closure and spanning trees with bounded total excess ⋮ Spanning trees with a bounded number of branch vertices in a claw-free graph ⋮ Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs ⋮ Rainbow and properly colored spanning trees in edge-colored bipartite graphs ⋮ Spanning \(k\)-ended trees in quasi-claw-free graphs ⋮ Degree conditions for the partition of a graph into cycles, edges and isolated vertices ⋮ Spanning Trees with Few Branch Vertices ⋮ Spanning k-ended trees of 3-regular connected graphs

This page was built for publication: Independence trees and Hamilton cycles