Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
From MaRDI portal
Publication:1114713
DOI10.1016/S0195-6698(86)80032-4zbMath0663.05051OpenAlexW2412994226MaRDI QIDQ1114713
Publication date: 1986
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(86)80032-4
Related Items
Extensions of matroid covering and packing ⋮ Decomposing 4-connected planar triangulations into two trees and one path ⋮ On fractional K‐factors of random graphs ⋮ Fractional spanning tree packing, forest covering and eigenvalues ⋮ Every matroid is a submatroid of a uniformly dense matroid ⋮ Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) ⋮ Spanning Rigid Subgraph Packing and Sparse Subgraph Covering ⋮ Balanced and 1-balanced graph constructions ⋮ A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs ⋮ Digraph analogues for the Nine Dragon Tree Conjecture ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number ⋮ Decomposing a graph into pseudoforests with one having bounded degree ⋮ Decomposing a graph into forests and a matching ⋮ Convex hulls of dense balanced graphs ⋮ Fractional arboricity, strength, and principal partitions in graphs and matroids ⋮ Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid ⋮ Decomposing a graph into forests: the nine dragon tree conjecture is true ⋮ Decomposing a graph into forests ⋮ The solution to an extremal problem on balanced extensions of graphs ⋮ Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
Cites Work
