Decomposing a graph into forests (Q765188): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Covering planar graphs with forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE COMPLEXITY OF SOME COLORING GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a planar graph into a forest and a subgraph of restricted maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a planar graph with girth 9 into a forest and a matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional arboricity, strength, and principal partitions in graphs and matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering planar graphs with forests, one having bounded maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-partitions of planar graphs and their game coloring numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of sparse graphs, with application to game coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a planar graph with girth at least 8 into a forest and a matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game coloring number of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined activation strategy for the marking game / rank
 
Normal rank

Revision as of 23:45, 4 July 2024

scientific article
Language Label Description Also known as
English
Decomposing a graph into forests
scientific article

    Statements

    Decomposing a graph into forests (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2012
    0 references
    fractional arboricity
    0 references
    maximum average degree
    0 references
    forests
    0 references
    decomposition
    0 references
    matching
    0 references
    planar graph
    0 references
    girth
    0 references

    Identifiers