The independence number condition for the existence of a spanning f-tree

DOI10.1002/jgt.20471zbMath1222.05023OpenAlexW2011441797MaRDI QIDQ3069673

Kenta Ozeki, Hikoe Enomoto

Publication date: 19 January 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20471

zbMATH Keywords

independence numberconnectivityspanning tree\(f\)-tree

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (4)

Spanning trees with bounded degrees and leaves ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ Spanning trees: A survey ⋮ On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)

Cites Work

• On a \(k\)-tree containing specified leaves in a graph
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Spanning trees with bounded degrees
• A note on Hamiltonian circuits

This page was built for publication: The independence number condition for the existence of a spanning f-tree