Decomposition of Finite Graphs Into Forests

Cited in

(only showing first 100 items - show all)

Covering planar graphs with forests, one having bounded maximum degree
On star and caterpillar arboricity
Rooted \(k\)-connections in digraphs
Sparsity-certifying graph decompositions
The chromatic index of nearly bipartite multigraphs
Minimum-maximal matching in series-parallel graphs
The analysis of a nested dissection algorithm
Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
On the thickness and arboricity of a graph
The reduction of graph families closed under contraction
Graphs without spanning closed trails
The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests
Flows and generalized coloring theorems in graphs
Two packing problems on \(k\)-matroid trees
Decompositions of graphs into forests with bounded maximum degree
Star arboricity
A note on the arboricity of graphs
Duality in graph families
Fractional arboricity, strength, and principal partitions in graphs and matroids
Edge-disjoint spanning trees and depth-first search
On maximally distant spanning trees of a graph
On partitions of graphs into trees
The game coloring number of planar graphs
A short proof of Nash-Williams' theorem for the arboricity of a graph
Acyclic edge-colorings of sparse graphs
Good and semi-strong colorings of oriented planar graphs
The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
On the tree number of regular graphs
Efficient computation of implicit representations of sparse graphs
Constructive characterizations for packing and covering with trees
On decomposing a hypergraph into \(k\) connected sub-hypergraphs
Combined connectivity augmentation and orientation problems
Minimum degree and minimum number of edge-disjoint trees
A linking polynomial of two matroids
Packing spanning trees in highly essentially connected graphs
Induced and weak induced arboricities
Extensions of matroid covering and packing
Trees, paths, stars, caterpillars and spiders
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs
On the game coloring index of \(F^+\)-decomposable graphs
Local and union boxicity
Facial packing vertex-coloring of subdivided plane graphs
Generalized arboricity of graphs with large girth
Thickness and outerthickness for embedded graphs
Decomposing a graph into forests and a matching
An enhancement of Nash-Williams' theorem on edge arboricity of graphs
Covering planar graphs with forests
The star arboricity of graphs
Surfaces, tree-width, clique-minors, and partitions
Every matroid is a submatroid of a uniformly dense matroid
Star arboricity of graphs
Group connectivity in 3-edge-connected graphs
The rigidity of infinite graphs
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
The incidence game chromatic number of \((a,d)\)-decomposable graphs
Edge-disjoint spanning trees and forests of graphs
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Distributed backup placement
k-plane matroids and Whiteley's flattening conjectures
Spanning tree packing and 2-essential edge-connectivity
Complete family reduction and spanning connectivity in line graphs
On some algorithmic aspects of hypergraphic matroids
An estimator for matching size in low arboricity graphs with two applications
On monoid graphs
The covering threshold of a directed acyclic graph by directed acyclic subgraphs
Sparse graphs and an augmentation problem
Rainbow and monochromatic circuits and cocircuits in binary matroids
An overview of graph covering and partitioning
Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
On coloring numbers of graph powers
Colouring planar graphs with bounded monochromatic components
Edge-coloring of plane multigraphs with many colors on facial cycles
Global rigidity of direction-length frameworks
The pseudoforest analogue for the strong nine dragon tree conjecture is true
Local and union page numbers
Graph rigidity for unitarily invariant matrix norms
Chvátal-Erdős conditions and almost spanning trails
Packing branchings under cardinality constraints on their root sets
Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
Graded sparse graphs and body-length-direction frameworks
Local algorithms for sparse spanning graphs
Complementary graphs with flows less than three
Distributed coloring in sparse graphs with fewer colors
Degree sequence realizations with given packing and covering of spanning trees
List coloring of matroids and base exchange properties
Caterpillar arboricity of planar graphs
Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
The \(k\)-strong induced arboricity of a graph
Regularity of symbolic powers and arboricity of matroids
Graphs with at most two trees in a forest-building process
Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
Partitions of complete geometric graphs into plane trees
Arboricity and tree-packing in locally finite graphs
The point-arboricity of a graph
Graphs with forbidden subgraphs
On the first-order edge tenacity of a graph
Proof-labeling schemes: broadcast, unicast and in between
Arboricity games: the core and the nucleolus
Single-pass streaming algorithms to partition graphs into few forests
Trade-offs in dynamic coloring for bipartite and general graphs

This page was built for publication: Decomposition of Finite Graphs Into Forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5731396)