Brick partitions of graphs
type: Item
instance of: scholarly article
title: Brick partitions of graphs
zbMATH Open document ID: 1243.05199
author: Bill Jackson
author: Tibor Jordán
published in: Discrete Mathematics
publication date: 2010-03-29T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5687556
zbMATH Keywords: edge-disjoint spanning trees
zbMATH Keywords: principal partitions
zbMATH Keywords: bricks and superbricks
MaRDI profile type: Publication
full work available at URL: j.disc.2008.09.034
OpenAlex ID: W2166018368
cites work: The principal minors of a matroid
cites work: Fractional arboricity, strength, and principal partitions in graphs and matroids
cites work: Optimal attack and reinforcement of a network
cites work: Q5593828
cites work: Graph orientations with edge-connection and parity constraints
cites work: Connectivity and edge-disjoint spanning trees
cites work: Q3934401
cites work: Rigid components in molecular graphs
cites work: Pin-collinear body-and-pin frameworks and the molecular conjecture
cites work: Complementary trees in circuit theory
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Q5582910
cites work: Q3330973
cites work: Q3327256
cites work: On the Problem of Decomposing a Graph into n Connected Factors
DOI: 10.1016/J.DISC.2008.09.034
description: scientific article; zbMATH DE number 5687556