Arbitrarily vertex decomposable trees are of maximum degree at most six
From MaRDI portal
Publication:5481324
zbMATH Open1093.05510MaRDI QIDQ5481324FDOQ5481324
Authors: Mirko Horňák, Mariusz Woźniak 
Publication date: 9 August 2006
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (20)
- Partitioning powers of traceable or Hamiltonian graphs
- Some families of arbitrarily vertex decomposable graphs
- Partitioning the Cartesian product of a tree and a cycle
- Decomposing trees with large diameter
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
- Dense on-line arbitrarily partitionable graphs
- Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
- An Ore-type condition for arbitrarily vertex decomposable graphs
- A degree bound on decomposable trees
- Arbitrary partitionability of product graphs
- On arbitrarily vertex decomposable trees
- Partitioning the Cartesian product of a sun-like graph and a path
- On the shape of decomposable trees
- Dense arbitrarily partitionable graphs
- Arbitrarily vertex decomposable suns with few rays
- On-line arbitrarily vertex decomposable suns
- Structural properties of recursively partitionable graphs with connectivity 2
- Some properties of minimal arbitrarily partitionable graphs
- An Ore-type condition for arbitrarily vertex decomposable graphs
- On-line arbitrarily vertex decomposable trees
This page was built for publication: Arbitrarily vertex decomposable trees are of maximum degree at most six
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5481324)
