Recursively arbitrarily vertex-decomposable graphs

DOI10.7494/OPMATH.2012.32.4.689MaRDI QIDQ4908861zbMATH OpenFDO

Authors Olivier Baudon, Frédéric Gilbert, Mariusz Woźniak

Publication date 7 March 2013

Published in Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/OPMATH.2012.32.4.689

zbMATH Keywords

arbitrary vertex decomposable (AVD) graphballoonsrecursively AVD graphs

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Recursively arbitrarily vertex-decomposable suns
• Arbitrarily vertex decomposable suns with few rays
• scientific article; zbMATH DE number 5238175
• On-line arbitrarily vertex decomposable trees
• On some families of arbitrarily vertex decomposable spiders

Cited in

(22)

• Arbitrarily vertex decomposable suns with few rays
• On-line arbitrarily vertex decomposable suns
• Dense arbitrarily vertex decomposable graphs
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• A new view toward vertex decomposable graphs
• More aspects of arbitrarily partitionable graphs
• Arbitrary partitionability of product graphs
• Partitioning the Cartesian product of a tree and a cycle
• On arbitrarily vertex decomposable trees
• On some families of arbitrarily vertex decomposable spiders
• Recursively arbitrarily vertex-decomposable suns
• scientific article; zbMATH DE number 1472110 (Why is no real title available?)
• Structural properties of recursively partitionable graphs with connectivity 2
• scientific article; zbMATH DE number 5238175 (Why is no real title available?)
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• An Ore-type condition for arbitrarily vertex decomposable graphs
• Some properties of minimal arbitrarily partitionable graphs
• Toughness of Recursively Partitionable Graphs
• Interplays between variations of arbitrarily partitionable graphs under minimality constraints
• On the structure of arbitrarily partitionable graphs with given connectivity
• Dense arbitrarily partitionable graphs
• On-line arbitrarily vertex decomposable trees

This page was built for publication: Recursively arbitrarily vertex-decomposable graphs

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