On the linear arboricity of graphs embeddable in surfaces (Q2448856): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2014.03.013 / rank
Normal rank
 
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: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Planar linear arboricity conjecture / 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: Q4248536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of composition graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of planar graphs of maximum degree seven is four / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2014.03.013 / rank
 
Normal rank

Latest revision as of 17:59, 18 December 2024

scientific article
Language Label Description Also known as
English
On the linear arboricity of graphs embeddable in surfaces
scientific article

    Statements

    On the linear arboricity of graphs embeddable in surfaces (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 2014
    0 references
    combinatorial problems
    0 references
    Euler characteristic
    0 references
    linear arboricity
    0 references
    embedded graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references