Brick partitions of graphs
From MaRDI portal
Recommendations
Cites work
- Complementary trees in circuit theory
- Connectivity and edge-disjoint spanning trees
- Edge-Disjoint Spanning Trees of Finite Graphs
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Graph orientations with edge-connection and parity constraints
- scientific article; zbMATH DE number 3859878 (Why is no real title available?)
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- scientific article; zbMATH DE number 3750964 (Why is no real title available?)
- scientific article; zbMATH DE number 3301261 (Why is no real title available?)
- scientific article; zbMATH DE number 3313442 (Why is no real title available?)
- On the Problem of Decomposing a Graph into n Connected Factors
- Optimal attack and reinforcement of a network
- Pin-collinear body-and-pin frameworks and the molecular conjecture
- Rigid components in molecular graphs
- The principal minors of a matroid
Cited in
(13)- On the rigidity of molecular graphs
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Sparse graphs and an augmentation problem
- Globally rigid powers of graphs
- Highly connected molecular graphs are rigid in three dimensions
- Generating near‐bipartite bricks
- Sparse graphs and an augmentation problem
- A proof of the molecular conjecture
- Bounded direction-length frameworks
- scientific article; zbMATH DE number 4187853 (Why is no real title available?)
- Generic global rigidity of body-bar frameworks
- How to see the forest despite the trees
- Pin-collinear body-and-pin frameworks and the molecular conjecture
This page was built for publication: Brick partitions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960924)