Structural properties of recursively partitionable graphs with connectivity 2

DOI10.7151/DMGT.1925MaRDI QIDQ505469zbMATH OpenOpenAlexFDO

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

Publication date 23 January 2017

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

balloon graphgraph with connectivity 2online arbitrarily partitionable graphrecursively arbitrarily partitionable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• On the structure of arbitrarily partitionable graphs with given connectivity
• More aspects of arbitrarily partitionable graphs
• Dense arbitrarily partitionable graphs
• Dense on-line arbitrarily partitionable graphs
• On the longest path in a recursively partitionable graph

Cites work

• A degree bound on decomposable trees
• A homology theory for spanning tress of a graph
• An Ore-type condition for arbitrarily vertex decomposable graphs
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Decomposable trees: A polynomial algorithm for tripodes
• scientific article; zbMATH DE number 3603293 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• On the longest path in a recursively partitionable graph
• On the structure of arbitrarily partitionable graphs with given connectivity
• On-line arbitrarily vertex decomposable trees
• Recursively arbitrarily vertex-decomposable graphs
• Recursively arbitrarily vertex-decomposable suns

Cited in

(9)

• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• More aspects of arbitrarily partitionable graphs
• Partitioning the Cartesian product of a tree and a cycle
• On the longest path in a recursively partitionable graph
• Some properties of minimal arbitrarily partitionable graphs
• Toughness of Recursively Partitionable Graphs
• Interplays between variations of arbitrarily partitionable graphs under minimality constraints
• Toughness properties of arbitrarily partitionable graphs
• On the structure of arbitrarily partitionable graphs with given connectivity

This page was built for publication: Structural properties of recursively partitionable graphs with connectivity 2

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