Decomposable trees: A polynomial algorithm for tripodes
From MaRDI portal
Publication:1613342
DOI10.1016/S0166-218X(00)00322-XzbMath1002.68107OpenAlexW2053543588MaRDI QIDQ1613342
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00322-x
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (24)
Dense on-line arbitrarily partitionable graphs ⋮ A degree bound on decomposable trees ⋮ More aspects of arbitrarily partitionable graphs ⋮ Dense arbitrarily vertex decomposable graphs ⋮ Partitioning powers of traceable or Hamiltonian graphs ⋮ Dense arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ On minimal arbitrarily partitionable graphs ⋮ 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 ⋮ 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 ⋮ 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: Decomposable trees: A polynomial algorithm for tripodes
