Decomposing a graph into forests
From MaRDI portal
Publication:765188
DOI10.1016/J.JCTB.2011.04.001zbMATH Open1237.05167OpenAlexW2090015399WikidataQ60060266 ScholiaQ60060266MaRDI QIDQ765188FDOQ765188
Recommendations
- Decompositions of graphs into forests with bounded maximum degree
- Decomposing a graph into forests and a matching
- Decomposing a planar graph with girth at least 8 into a forest and a matching
- Decomposition of sparse graphs into forests and a graph with bounded degree
- Covering a graph by forests and a matching
Cites Work
- scientific article; zbMATH DE number 398953 (Why is no real title available?)
- scientific article; zbMATH DE number 866055 (Why is no real title available?)
- Covering planar graphs with forests
- Covering planar graphs with forests, one having bounded maximum degree
- Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
- Decomposing a planar graph with girth 9 into a forest and a matching
- Decomposing a planar graph with girth at least 8 into a forest and a matching
- Decomposition of Finite Graphs Into Forests
- Decomposition of sparse graphs into forests and a graph with bounded degree
- Decomposition of sparse graphs, with application to game coloring number
- Edge-partitions of planar graphs and their game coloring numbers
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- ON THE COMPLEXITY OF SOME COLORING GAMES
- On the degrees of the vertices of a directed graph
- Refined activation strategy for the marking game
- The game coloring number of planar graphs
Cited In (32)
- On the minimum number of arcs in \(k\)-dicritical oriented graphs
- Decomposing graphs into a spanning tree, an even graph, and a star forest
- Generalized arboricity of graphs with large girth
- Title not available (Why is no real title available?)
- Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
- Decomposition of sparse graphs into forests and a graph with bounded degree
- Forests decomposition of graphs without 4-cycles
- Decomposing a graph into forests: the nine dragon tree conjecture is true
- Decomposing a graph into forests and a matching
- Extensions of matroid covering and packing
- Decomposing 4-connected planar triangulations into two trees and one path
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
- Digraph analogues for the Nine Dragon Tree Conjecture
- Covering a graph by forests and a matching
- The incidence game chromatic number of \((a,d)\)-decomposable graphs
- Decomposing planar graphs into graphs with degree restrictions
- Decompositions into two linear forests of bounded lengths
- Title not available (Why is no real title available?)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
- Thin trees in 8-edge-connected planar graphs
- On the game coloring index of \(F^+\)-decomposable graphs
- The pseudoforest analogue for the strong nine dragon tree conjecture is true
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs
- Tree-thickness and caterpillar-thickness under girth constraints
- Decomposing plane cubic graphs
- Decomposing a graph into pseudoforests with one having bounded degree
- An extension of Nash-Williams and Tutte's theorem
- Colouring planar graphs with bounded monochromatic components
- Decomposing a planar graph with girth 9 into a forest and a matching
- Planar graphs decomposable into a forest and a matching
- The coloring game on planar graphs with large girth, by a result on sparse cactuses
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
This page was built for publication: Decomposing a graph into forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765188)
