Decomposition of Finite Graphs Into Forests
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The complexity of decomposing a graph into a matching and a bounded linear forest
- On globally sparse Ramsey graphs
- Facial parity edge colouring of plane pseudographs
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
- Graph rigidity for unitarily invariant matrix norms
- Computing weighted strength and applications to partitioning
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- An overview of graph covering and partitioning
- Improved induced matchings in sparse graphs
- Caterpillar arboricity of planar graphs
- On the first-order edge tenacity of a graph
- Structural theorems for submodular functions, polymatroids and polymatroid intersections
- On the toric ideals of matroids of a fixed rank
- Packing branchings under cardinality constraints on their root sets
- Arboricity and tree-packing in locally finite graphs
- Minimum-maximal matching in series-parallel graphs
- Decomposition of geometric graphs into star-forests
- Multi-word-representability of graphs
- Trees, Paths, Stars, Caterpillars and Spiders
- scientific article; zbMATH DE number 7561635 (Why is no real title available?)
- Combined connectivity augmentation and orientation problems
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid
- Decomposition of sparse graphs into two forests, one having bounded maximum degree
- Facial packing vertex-coloring of subdivided plane graphs
- Generalized arboricity of graphs with large girth
- Degree Ramsey numbers of graphs
- Subtree and substar intersection numbers
- Induced-path partition on graphs with special blocks
- The chromatic index of nearly bipartite multigraphs
- A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
- The covering threshold of a directed acyclic graph by directed acyclic subgraphs
- Adaptive massively parallel coloring in sparse graphs
- Mixing of the Glauber dynamics for the ferromagnetic Potts model
- On-line list coloring of matroids
- Minimum cost globally rigid subgraphs
- Star number and star arboricity of a complete multigraph
- The Treewidth and Pathwidth of Graph Unions
- Bounded direction-length frameworks
- Group connectivity of graphs with diameter at most 2
- scientific article; zbMATH DE number 1222606 (Why is no real title available?)
- Modulus for bases of matroids
- On the higher-order edge toughness of a graph
- Cyclic orderings and cyclic arboricity of matroids
- Covering planar graphs with forests, one having a bounded maximum degree
- The degree-diameter problem for sparse graph classes
- Arboricity games: the core and the nucleolus
- Star arboricity
- An intermediate value theorem for the arboricities
- On covering numbers, Young diagrams, and the local dimension of posets
- On some algorithmic aspects of hypergraphic matroids
- Packing spanning trees in highly essentially connected graphs
- Minimum degree and minimum number of edge-disjoint trees
- On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
- Thickness and outerthickness for embedded graphs
- Successive minimum spanning trees
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
- Decomposition of sparse graphs into forests and a graph with bounded degree
- Pin-collinear body-and-pin frameworks and the molecular conjecture
- Rainbow and monochromatic circuits and cocircuits in binary matroids
- scientific article; zbMATH DE number 4085704 (Why is no real title available?)
- The generic rank of body-bar-and-hinge frameworks
- Resolution of the Kohayakawa-Kreuter conjecture
- A constructive arboricity approximation scheme
- On constructive characterizations of (k,l)-sparse graphs
- List total arboricity of 2-degenerate graphs
- The rigidity of infinite graphs
- Graphs without spanning closed trails
- An estimator for matching size in low arboricity graphs with two applications
- Sparse graphs and an augmentation problem
- Induced and weak induced arboricities
- On monoid graphs
- Threshold Functions for H-factors
- Graphs with forbidden subgraphs
- Sparse graphs and an augmentation problem
- Distributed coloring in sparse graphs with fewer colors
- Interval colourable orientations of graphs
- List coloring of matroids and base exchange properties
- The 4-girth-thickness of the complete multipartite graph
- Positional dominance: concepts and algorithms
- Spectral radius and edge‐disjoint spanning trees
- Decomposing a graph into forests: the nine dragon tree conjecture is true
- Decomposing a graph into forests and a matching
- A linking polynomial of two matroids
- Degree bounded forest covering
- Sparse graphs and the fixed points on type spaces property
- Flows and generalized coloring theorems in graphs
- On the Thickness of Sparse Random Graphs
- A combinatorial study of the rigidity of planar structures
- The tree number of a graph with a given girth
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
- Extensions of matroid covering and packing
- The Steiner Problem for Count Matroids
- Edge-disjoint spanning trees and depth-first search
- Gauging tensor networks with belief propagation
- Infinitesimal rigidity for non-Euclidean bar-joint frameworks
- The sparse awakens: streaming algorithms for matching size estimation in sparse graphs
- The overfull nine dragon tree conjecture is true
- On coloring numbers of graph powers
- Balanced generic circuits without long paths
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
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)
