scientific article; zbMATH DE number 3349867
From MaRDI portal
Publication:5625199
zbMATH Open0221.05053MaRDI QIDQ5625199FDOQ5625199
Publication date: 1971
Title of this publication is not available (Why is that?)
Cited In (21)
- Spanning \(k\)-ended trees of bipartite graphs
- Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves
- Spanning 5-ended trees in \(K_{1,5}\)-free graphs
- Neighborhood unions and extremal spanning trees
- A note on the computation on the k-closure of a graph
- Spanning trees with few peripheral branch vertices
- Generalizations of the classics to spanning connectedness
- Spanning k-ended trees of 3-regular connected graphs
- Two theorems on Hamiltonian graphs
- Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
- Sur les arborescences dans un graphe oriente
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
- A method in graph theory
- Stable properties of graphs
- Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs
- Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices
- A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph
- A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph
- Spanning spiders and light-splitting switches
- Spanning trees whose reducible stems have a few branch vertices
- Matching and spanning in certain planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5625199)
