Structural properties of recursively partitionable graphs with connectivity 2

DOI10.7151/dmgt.1925zbMath1400.05197MaRDI QIDQ505469

Julien Bensmail, Olivier Baudon, Florent Foucaud, Monika Pilśniak

Publication date: 23 January 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1925

zbMATH Keywords

balloon graph; graph with connectivity 2; online arbitrarily partitionable graph; recursively arbitrarily partitionable graph

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C75: Structural characterization of families of graphs

Related Items

Unnamed Item, On the structure of arbitrarily partitionable graphs with given connectivity, Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs, More aspects of arbitrarily partitionable graphs, Partitioning the Cartesian product of a tree and a cycle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of arbitrarily partitionable graphs with given connectivity
• On-line arbitrarily vertex decomposable trees
• Decomposable trees: A polynomial algorithm for tripodes
• A degree bound on decomposable trees
• On the longest path in a recursively partitionable graph
• Recursively arbitrarily vertex-decomposable suns
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• A homology theory for spanning tress of a graph
• Recursively arbitrarily vertex-decomposable graphs
• An Ore-type condition for arbitrarily vertex decomposable graphs