Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
From MaRDI portal
Publication:1218870
DOI10.1007/BF02995957zbMath0309.05122MaRDI QIDQ1218870
Publication date: 1975
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
Related Items (26)
Triangle-Tilings in Graphs Without Large Independent Sets ⋮ On a \(k\)-tree containing specified leaves in a graph ⋮ A \(k\)-tree containing specified vertices ⋮ Degree bounded spanning trees ⋮ Binding numbers and connected factors ⋮ A note on spanning trees with a specified degree sequence ⋮ The number of bounded‐degree spanning trees ⋮ Spanning trees: A survey ⋮ Spanning \(k\)-trees of \(n\)-connected graphs ⋮ Spanning trees with bounded degrees ⋮ Spanning \(k\)-trees of bipartite graphs ⋮ On covering vertices of a graph by trees ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ On a spanning \(k\)-tree in which specified vertices have degree less than \(k\) ⋮ An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem ⋮ On spanning trees with few branch vertices ⋮ Closure and spanning trees with bounded total excess ⋮ Spanning trees with a bounded number of branch vertices in a claw-free graph ⋮ Closure and spanning \(k\)-trees ⋮ On a spanning \(K\)-tree containing specified vertices in a graph ⋮ Rainbow and properly colored spanning trees in edge-colored bipartite graphs ⋮ Degree sum condition for the existence of spanning \(k\)-trees in star-free graphs ⋮ Degree conditions and degree bounded trees ⋮ Spanning Trees with Few Branch Vertices ⋮ A degree sum condition for graphs to be prism Hamiltonian ⋮ Degree Conditions and Degree Bounded Trees
Cites Work
This page was built for publication: Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
