Structural properties of recursively partitionable graphs with connectivity 2

DOI10.7151/DMGT.1925zbMATH Open1400.05197OpenAlexW2277216011MaRDI QIDQ505469FDOQ505469

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)

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

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

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)

Cites Work

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

Cited In (8)

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

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)