Balanced and 1-balanced graph constructions
From MaRDI portal
Publication:608258
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 436073 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3750966 (Why is no real title available?)
- scientific article; zbMATH DE number 54793 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Balanced graphs and network flows
- Connectivity and edge-disjoint spanning trees
- Connectivity of generalized prisms over G
- Convex hulls of dense balanced graphs
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- Strongly balanced graphs and random graphs
Cited in
(6)- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
- Cyclic base ordering of certain degenerate graphs
- CFI Construction and Balanced Graphs
- Cyclic base ordering of generalized Petersen graphs
- scientific article; zbMATH DE number 436073 (Why is no real title available?)
- Transforming a graph into a 1-balanced graph
This page was built for publication: Balanced and 1-balanced graph constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q608258)