Minimum number of disjoint linear forests covering a planar graph (Q405685): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-013-9680-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969869202 / 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 / 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: Linear arboricity and linear \(k\)-arboricity of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclically 3-colorable planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating the edge-colourings and total colourings of a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Planar linear arboricity conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring of double disk graphs / 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: The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear arboricity of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexité de l'arboricité linéaire d'un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree / 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

Latest revision as of 23:59, 8 July 2024

scientific article
Language Label Description Also known as
English
Minimum number of disjoint linear forests covering a planar graph
scientific article

    Statements

    Minimum number of disjoint linear forests covering a planar graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 September 2014
    0 references
    planar graph
    0 references
    linear forest
    0 references
    cycle
    0 references
    covering
    0 references

    Identifiers