Decompositions of graphs into forests with bounded maximum degree (Q1185098): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3826592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of some regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on linear arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: COVERING AND PACKING IN GRAPHS, I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815343 / rank
 
Normal rank

Latest revision as of 16:17, 15 May 2024

scientific article
Language Label Description Also known as
English
Decompositions of graphs into forests with bounded maximum degree
scientific article

    Statements

    Decompositions of graphs into forests with bounded maximum degree (English)
    0 references
    28 June 1992
    0 references
    forest decomposition
    0 references
    multigraph
    0 references
    arboricity
    0 references
    Nash-Williams formula
    0 references
    forests
    0 references
    degrees
    0 references
    Linear Arboricity Conjecture
    0 references

    Identifiers