A note on the arboricity of graphs (Q1205341): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3907606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and packing in graphs IV: Linear arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / 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: Q3752419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02351587 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988582774 / rank
 
Normal rank

Latest revision as of 10:42, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on the arboricity of graphs
scientific article

    Statements

    A note on the arboricity of graphs (English)
    0 references
    0 references
    1 April 1993
    0 references
    decomposition
    0 references
    cover
    0 references
    theorem of Nash-Williams
    0 references
    forests
    0 references
    arboricity
    0 references
    regular graphs
    0 references

    Identifiers