A degree bound on decomposable trees
From MaRDI portal
Publication:2368920
DOI10.1016/j.disc.2006.01.006zbMath1092.05054OpenAlexW2121217162MaRDI QIDQ2368920
Hervé Fournier, Dominique Barith
Publication date: 28 April 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.01.006
Trees (05C05) Combinatorial aspects of partitions of integers (05A17) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (21)
More aspects of arbitrarily partitionable graphs ⋮ Dense arbitrarily vertex decomposable graphs ⋮ Partitioning powers of traceable or Hamiltonian graphs ⋮ Unnamed Item ⋮ On minimal arbitrarily partitionable graphs ⋮ 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 ⋮ 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 ⋮ On three polynomial kernels of sequences for arbitrarily partitionable graphs ⋮ On the structure of arbitrarily partitionable graphs with given connectivity ⋮ 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 ⋮ On the complexity of partitioning a graph into a few connected subgraphs ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
Cites Work
This page was built for publication: A degree bound on decomposable trees
