scientific article; zbMATH DE number 5044683

zbMath1093.05510MaRDI QIDQ5481324

Mirko Horňák, Mariusz Woźniak

Publication date: 9 August 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tree, vertex-decomposition.

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (20)

Dense on-line arbitrarily partitionable graphs ⋮ A degree bound on decomposable trees ⋮ Partitioning powers of traceable or Hamiltonian graphs ⋮ Dense arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles ⋮ Structural properties of recursively partitionable graphs with connectivity 2 ⋮ On arbitrarily vertex decomposable trees ⋮ Arbitrary partitionability of product graphs ⋮ An Ore-type condition for arbitrarily vertex decomposable graphs ⋮ An Ore-type condition for arbitrarily vertex decomposable graphs ⋮ Decomposing trees with large diameter ⋮ On-line arbitrarily vertex decomposable trees ⋮ Arbitrarily vertex decomposable suns with few rays ⋮ On the shape of decomposable trees ⋮ On-line arbitrarily vertex decomposable suns ⋮ Partitioning the Cartesian product of a tree and a cycle ⋮ Some families of arbitrarily vertex decomposable graphs ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

This page was built for publication: