Independence number and \(k\)-trees of graphs

DOI10.1007/S00373-017-1821-4zbMath1380.05155OpenAlexW2626979389MaRDI QIDQ1684925

Zheng Yan

Publication date: 12 December 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1821-4

zbMATH Keywords

independence number\(k\)-tree

Mathematics Subject Classification ID

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

Related Items (1)

A note on the independence number, connectivity and \(k\)-ended tree

Cites Work

• A \(k\)-tree containing specified vertices
• A degree sum condition concerning the connectivity and the independence number of a graph
• Spanning trees with bounded degrees
• Cycles in graphs with prescribed stability number and connectivity
• A note on Hamiltonian circuits

This page was built for publication: Independence number and \(k\)-trees of graphs