On a k-tree containing specified leaves in a graph
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- Independence number and \(k\)-trees of graphs
- The independence number condition for the existence of a spanning \(f\)-tree
- Spanning trees with bounded degrees and leaves
- The existence of \(f\)-forests and \(f\)-trees in graphs
- Spanning \(k\)-trees of \(n\)-connected graphs
- On spanning trees with few branch vertices
- Spanning \(k\)-tree with specified vertices
- Spanning trees with a bounded number of branch vertices in a claw-free graph
- On a spanning tree with specified leaves
- On a spanning \(K\)-tree containing specified vertices in a graph
- On unavoidability of trees with \(k\) leaves
- A \(k\)-tree containing specified vertices
- On a spanning tree with specified leaves in a bipartite graph
- Spanning \(k\)-trees of bipartite graphs
- On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
- Chvátal–Erdős Theorem: Old Theorem with New Aspects
- Spanning trees: A survey
- A note on the independence number, connectivity and \(k\)-ended tree
This page was built for publication: On a \(k\)-tree containing specified leaves in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855299)