Independence trees and Hamilton cycles
From MaRDI portal
Publication:4242952
DOI10.1002/(SICI)1097-0118(199812)29:4%3C227::AID-JGT2%3E3.0.CO;2-WzbMATH Open0919.05017OpenAlexW4239638204MaRDI QIDQ4242952FDOQ4242952
Authors: Hilde Tuinstra, Hajo Broersma 
Publication date: 11 May 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199812)29:4%3C227::aid-jgt2%3E3.0.co;2-w
Recommendations
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)
Cited In (39)
- Spanning \(k\)-ended trees of bipartite graphs
- 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
- Closure and spanning trees with bounded total excess
- A note on spanning trees with a specified degree sequence
- Degree conditions for graphs to have spanning trees with few branch vertices and leaves
- Spanning trees with a bounded number of leaves
- Progress on sufficient conditions for a graph to have a spanning \(k\)-ended tree
- Spanning trees with small degrees and few leaves
- Number of vertices of degree three in spanning 3-trees in square graphs
- Spanning trees: A survey
- Spanning trees with few peripheral branch vertices
- Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs
- Spectral radius and spanning trees of graphs
- On 3-stable number conditions in \(n\)-connected claw-free graphs
- Spanning trees whose reducible stems have a few branch vertices.
- Spanning Trees with Few Branch Vertices
- Degree conditions for the partition of a graph into cycles, edges and isolated vertices
- Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Spanning trees homeomorphic to a small tree
- Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs
- Characterizing spanning trees via the size or the spectral radius of graphs
- Spanning \(k\)-trees of \(n\)-connected graphs
- Spanning \(k\)-ended trees of 3-regular connected graphs
- A note on computing graph closures
- Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs
- On spanning trees with few branch vertices
- Spanning \(k\)-ended trees in quasi-claw-free graphs
- A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph
- Spanning trees with few leaves
- A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph
- Spanning trees with a bounded number of branch vertices in a claw-free graph
- On a spanning tree with specified leaves
- Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs
- Spanning trees with few peripheral branch vertices in a connected claw-free graph
This page was built for publication: Independence trees and Hamilton cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242952)
