An improved upper bound on the linear 2-arboricity of planar graphs (Q501025): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q831026
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yi Qiao Wang / 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.1016/j.disc.2015.07.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1640262016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear k-arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of linear \(k\)-arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear \(k\)-arboricities on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems about linear arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear \(k\)-arboricity of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear 2-arboricity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 5-cycles or without 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558480 / rank
 
Normal rank

Latest revision as of 20:44, 10 July 2024

scientific article
Language Label Description Also known as
English
An improved upper bound on the linear 2-arboricity of planar graphs
scientific article

    Statements

    An improved upper bound on the linear 2-arboricity of planar graphs (English)
    0 references
    8 October 2015
    0 references
    planar graph
    0 references
    linear 2-arboricity
    0 references
    maximum degree
    0 references
    0 references

    Identifiers