Recursively arbitrarily vertex-decomposable graphs
From MaRDI portal
Publication:4908861
DOI10.7494/OpMath.2012.32.4.689zbMath1259.05135MaRDI QIDQ4908861
Olivier Baudon, Frédéric Gilbert, Mariusz Woźniak
Publication date: 7 March 2013
Published in: Opuscula Mathematica (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Connectivity (05C40)
Related Items
More aspects of arbitrarily partitionable graphs ⋮ Dense arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ Structural properties of recursively partitionable graphs with connectivity 2 ⋮ Arbitrary partitionability of product graphs ⋮ On the structure of arbitrarily partitionable graphs with given connectivity ⋮ Partitioning the Cartesian product of a tree and a cycle ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs