Spanning trees with few leaves in almost claw-free graphs

DOI10.3770/J.ISSN:2095-2651.2016.04.007MaRDI QIDQ5277014zbMATH OpenFDO

Authors Xiaodong Chen, Meijin Xu, Mingchu Li

Publication date 14 July 2017

zbMATH Keywords

insertible vertexnon-insertible vertexalmost claw-free graphspanning 3-ended tree

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Spanning 3-ended trees in almost claw-free graphs
• scientific article; zbMATH DE number 6770068
• Spanning \(k\)-ended trees of a claw-free graph
• Spanning trees with a bounded number of leaves in a claw-free graph.
• Spanning \(3\)-ended trees in quasi-claw-free graphs.

Cited in

(10)

• Spanning 3-ended trees in almost claw-free graphs
• Depth first search in claw-free graphs
• Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
• The existence of spanning ended system on claw-free graphs
• Spanning \(k\)-ended trees of a claw-free graph
• Spanning \(3\)-ended trees in quasi-claw-free graphs.
• On spanning trees with few branch vertices
• Spanning k-ended trees in quasi-claw-free graphs
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Spanning trees with a bounded number of leaves in a claw-free graph.

This page was built for publication: Spanning trees with few leaves in almost claw-free graphs

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