On-line arbitrarily vertex decomposable trees

DOI10.1016/J.DAM.2007.02.011MaRDI QIDQ997067zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On arbitrarily vertex decomposable trees
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• Recursively arbitrarily vertex-decomposable graphs
• On-line arbitrarily vertex decomposable suns

Cites work

• A degree bound on decomposable trees
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Decomposable trees: A polynomial algorithm for tripodes

Cited in

(18)

• Arbitrarily vertex decomposable suns with few rays
• More aspects of arbitrarily partitionable graphs
• Some properties of minimal arbitrarily partitionable graphs
• On-line arbitrarily vertex decomposable suns
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• Dense arbitrarily partitionable graphs
• Dense arbitrarily vertex decomposable graphs
• Dense on-line arbitrarily partitionable graphs
• Interplays between variations of arbitrarily partitionable graphs under minimality constraints
• An Ore-type condition for arbitrarily vertex decomposable graphs
• Some families of arbitrarily vertex decomposable graphs
• Structural properties of recursively partitionable graphs with connectivity 2
• Partitioning the Cartesian product of a tree and a cycle
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Recursively arbitrarily vertex-decomposable graphs
• On the structure of arbitrarily partitionable graphs with given connectivity
• On the shape of decomposable trees
• On arbitrarily vertex decomposable trees

This page was built for publication: On-line arbitrarily vertex decomposable trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997067)