On-line arbitrarily vertex decomposable trees

DOI10.1016/j.dam.2007.02.011zbMath1122.68086OpenAlexW1996538461MaRDI QIDQ997067

Mariusz Woźniak, Zsolt Tuza, Mirko Horňák

Publication date: 19 July 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.02.011

zbMATH Keywords

on-linearbitrarily vertex decomposable graphs

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Dense on-line arbitrarily partitionable graphs ⋮ More aspects of arbitrarily partitionable graphs ⋮ Dense arbitrarily vertex decomposable graphs ⋮ Dense arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ Structural properties of recursively partitionable graphs with connectivity 2 ⋮ On arbitrarily vertex decomposable trees ⋮ An Ore-type condition for arbitrarily vertex decomposable 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 ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

Cites Work

• Decomposable trees: A polynomial algorithm for tripodes
• A degree bound on decomposable trees
• Unnamed Item