Spanning trees whose reducible stems have a few branch vertices.

DOI10.21136/CMJ.2021.0073-20MaRDI QIDQ4959538zbMATH OpenFDO

Authors Pham Hoang Ha, Dang Dinh Hanh, Nguyen Thanh Loan, Ngoc Diep Pham

Publication date 16 September 2021

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21136/CMJ.2021.0073-20

zbMATH Keywords

degree sumindependence numberreducible stemspanning tree

Mathematics Subject Classification ID

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

Recommendations

• Spanning trees with few peripheral branch vertices
• Spanning trees whose stems have a bounded number of branch vertices
• scientific article; zbMATH DE number 6424518
• Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves
• Spanning trees whose stems have at most k leaves.

Cites work

• Degree conditions for graphs to have spanning trees with few branch vertices and leaves
• Hamiltonian results inK1,3-free graphs
• scientific article; zbMATH DE number 6424518 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 3349867 (Why is no real title available?)
• Independence trees and Hamilton cycles
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
• Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves
• Spanning trees whose stems are spiders
• Spanning trees whose stems have a bounded number of branch vertices
• Spanning trees whose stems have at most k leaves.
• Spanning trees with a bounded number of leaves in a claw-free graph.
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees with few peripheral branch vertices
• Spanning trees: A survey

Cited in

(7)

• Spanning trees with few peripheral branch vertices
• Conditions for spanning trees whose internal subtrees have few branch vertices and leaves
• Spanning trees with few peripheral branch vertices in a connected claw-free graph
• Reduced representations of rooted trees.
• scientific article; zbMATH DE number 6424518 (Why is no real title available?)
• Spanning Trees of a Claw-Free Graph Whose Reducible Stems Have Few Leaves
• Spanning trees whose stems have a bounded number of branch vertices

This page was built for publication: Spanning trees whose reducible stems have a few branch vertices.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959538)