Structural properties of recursively partitionable graphs with connectivity 2
type: Item
instance of: scholarly article
title: Structural properties of recursively partitionable graphs with connectivity 2
zbMATH Open document ID: 1400.05197
author: Olivier Baudon
author: Julien Bensmail
author: Florent Foucaud
author: Monika Pilśniak
publication date: 2017-01-23T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6676789
zbMATH Keywords: online arbitrarily partitionable graph
zbMATH Keywords: recursively arbitrarily partitionable graph
zbMATH Keywords: graph with connectivity 2
zbMATH Keywords: balloon graph
MaRDI profile type: Publication
full work available at URL: dmgt.1925
OpenAlex ID: W2277216011
cites work: Decomposable trees: A polynomial algorithm for tripodes
cites work: A degree bound on decomposable trees
cites work: On the structure of arbitrarily partitionable graphs with given connectivity
cites work: Recursively arbitrarily vertex-decomposable suns
cites work: Recursively arbitrarily vertex-decomposable graphs
cites work: On the longest path in a recursively partitionable graph
cites work: Arbitrarily vertex decomposable caterpillars with four or five leaves
cites work: Q5315023
cites work: Q4168622
cites work: On-line arbitrarily vertex decomposable trees
cites work: Q5481324
cites work: A homology theory for spanning tress of a graph
cites work: An Ore-type condition for arbitrarily vertex decomposable graphs
DOI: 10.7151/DMGT.1925
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 6676789