Brick partitions of graphs

DOI10.1016/j.disc.2008.09.034zbMath1243.05199OpenAlexW2166018368MaRDI QIDQ960924

Tibor Jordán, Bill Jackson

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.034

zbMATH Keywords

edge-disjoint spanning treesbricks and superbricksprincipal partitions

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Sparse Graphs and an Augmentation Problem ⋮ Globally rigid powers of graphs ⋮ Highly connected molecular graphs are rigid in three dimensions ⋮ Pin-collinear body-and-pin frameworks and the molecular conjecture ⋮ A proof of the molecular conjecture ⋮ Bounded direction-length frameworks ⋮ On the rigidity of molecular graphs ⋮ Sparse graphs and an augmentation problem

Cites Work

• Pin-collinear body-and-pin frameworks and the molecular conjecture
• Rigid components in molecular graphs
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• The principal minors of a matroid
• Graph orientations with edge-connection and parity constraints
• Connectivity and edge-disjoint spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Optimal attack and reinforcement of a network
• Complementary trees in circuit theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item