On the total choosability of planar graphs and of sparse graphs (Q407575): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978952272 / rank
 
Normal rank

Revision as of 02:31, 20 March 2024

scientific article
Language Label Description Also known as
English
On the total choosability of planar graphs and of sparse graphs
scientific article

    Statements

    On the total choosability of planar graphs and of sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 March 2012
    0 references
    combinatorial problems
    0 references
    total coloring
    0 references
    total choosability
    0 references
    planar graphs
    0 references
    cycle-free
    0 references
    maximum average degree
    0 references
    mad
    0 references

    Identifiers