On-line arbitrarily vertex decomposable trees

DOI10.1016/J.DAM.2007.02.011zbMATH Open1122.68086OpenAlexW1996538461MaRDI QIDQ997067FDOQ997067

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

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

zbMATH Keywords

on-linearbitrarily vertex decomposable graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

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

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)