Decomposable trees: A polynomial algorithm for tripodes

DOI10.1016/S0166-218X(00)00322-XzbMath1002.68107MaRDI QIDQ1613342

R. Smith

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

zbMATH Keywords

polynomial algorithm; graphs modelling interconnection networks

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

An Ore-type condition for arbitrarily vertex decomposable graphs, An Ore-type condition for arbitrarily vertex decomposable graphs, On three polynomial kernels of sequences for arbitrarily partitionable graphs, Unnamed Item, Unnamed Item, Partitioning powers of traceable or Hamiltonian graphs, On minimal arbitrarily partitionable graphs, Structural properties of recursively partitionable graphs with connectivity 2, Dense arbitrarily partitionable 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, Dense arbitrarily vertex decomposable graphs, Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs, More aspects of arbitrarily partitionable graphs, Partitioning the Cartesian product of a tree and a cycle, On the complexity of partitioning a graph into a few connected subgraphs, Dense on-line arbitrarily partitionable graphs, A degree bound on decomposable trees, On arbitrarily vertex decomposable trees, Some families of arbitrarily vertex decomposable graphs, Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles

Cites Work

• Unnamed Item
• Unnamed Item