\(k\)-forested choosability of planar graphs and sparse graphs (Q764887): 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.1016/j.disc.2011.10.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991031649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic Colourings of Planar Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and 2-frugal choosability of graphs of small maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of sparse hessian matrices and graph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear choosability of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented colorings of 2-outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring a graph frugally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frugal, acyclic and star colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear coloring of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear coloring of graphs embeddable in a surface of nonnegative characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-forested coloring of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-forested choosability of graphs with bounded maximum average degree / rank
 
Normal rank

Latest revision as of 23:40, 4 July 2024

scientific article
Language Label Description Also known as
English
\(k\)-forested choosability of planar graphs and sparse graphs
scientific article

    Statements

    \(k\)-forested choosability of planar graphs and sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    16 March 2012
    0 references
    \(k\)-forested coloring
    0 references
    linear coloring
    0 references
    frugal coloring
    0 references
    maximum average degree
    0 references
    planar graph
    0 references

    Identifiers