The linear arboricity of planar graphs without 5-, 6-cycles with chords (Q2376109): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: 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: COVERING AND PACKING IN GRAPHS, I. / 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 planar graphs with no short cycles / 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

Latest revision as of 13:37, 6 July 2024

scientific article
Language Label Description Also known as
English
The linear arboricity of planar graphs without 5-, 6-cycles with chords
scientific article

    Statements

    The linear arboricity of planar graphs without 5-, 6-cycles with chords (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2013
    0 references
    planar graph
    0 references
    linear arboricity
    0 references
    cycle
    0 references

    Identifiers