Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00493-016-3390-1 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00493-016-3390-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2535651506 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q122923058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering planar graphs with forests / 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: Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a graph into pseudoforests with one having bounded 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: Covering planar graphs with forests, one having bounded maximum degree / 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: Decomposing a graph 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: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game coloring number of planar graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00493-016-3390-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:02, 10 December 2024

scientific article
Language Label Description Also known as
English
Decomposing a graph into forests: the nine dragon tree conjecture is true
scientific article

    Statements

    Identifiers