On minimal arbitrarily partitionable graphs
type: Item
instance of: scholarly article
title: On minimal arbitrarily partitionable graphs
zbMATH Open document ID: 1248.05152
author: Olivier Baudon
author: Jakub Przybyło
author: Mariusz Woźniak
published in: Information Processing Letters
publication date: 2012-10-23T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6098069
zbMATH Keywords: minimal arbitrarily partitionable graph
zbMATH Keywords: arbitrary vertex decomposable graph
zbMATH Keywords: interconnection networks
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.06.010
OpenAlex ID: W2057626995
cites work: Decomposable trees: A polynomial algorithm for tripodes
cites work: A degree bound on decomposable trees
cites work: On the shape of decomposable trees
cites work: On the structure of arbitrarily partitionable graphs with given connectivity
cites work: Arbitrarily vertex decomposable caterpillars with four or five leaves
cites work: Q4168622
cites work: On arbitrarily vertex decomposable trees
cites work: A homology theory for spanning tress of a graph
cites work: A linear-time algorithm for four-partitioning four-connected planar graphs
cites work: Decomposing trees with large diameter
cites work: A linear algorithm for bipartition of biconnected graphs
DOI: 10.1016/J.IPL.2012.06.010
Recommended article: Q6134940
Recommended article: Q4552255
Recommended article: On the structure of arbitrarily partitionable graphs with given connectivity
Recommended article: Graph partitions with minimum degree constraints
Recommended article: Q3764175
Recommended article: Partitions of multigraphs under minimum degree constraints
Recommended article: Q3335827
Recommended article: Q3650134
Recommended article: Q4087229
Recommended article: On partitional and other related graphs
description: scientific article; zbMATH DE number 6098069