Recursively arbitrarily vertex-decomposable suns

DOI10.7494/OPMATH.2011.31.4.533zbMath1234.05182OpenAlexW4254496649MaRDI QIDQ3093023

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

Publication date: 12 October 2011

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2011.31.4.533

zbMATH Keywords

arbitrarily vertex-decomposable graphs (AVD)recursively AVD graphs

Mathematics Subject Classification ID

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

Related Items (3)

Partitioning powers of traceable or Hamiltonian graphs ⋮ Dense arbitrarily partitionable graphs ⋮ Structural properties of recursively partitionable graphs with connectivity 2

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