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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2010.07.007 / rank
Normal rank
 
Property / author
 
Property / author: Jian-Feng Hou / rank
Normal rank
 
Property / author
 
Property / author: Jian-Feng Hou / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6018489 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / zbMATH Keywords
 
total coloring
Property / zbMATH Keywords: total coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
total choosability
Property / zbMATH Keywords: total choosability / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graphs
Property / zbMATH Keywords: planar graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
cycle-free
Property / zbMATH Keywords: cycle-free / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum average degree
Property / zbMATH Keywords: maximum average degree / rank
 
Normal rank
Property / zbMATH Keywords
 
mad
Property / zbMATH Keywords: mad / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978952272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total colourings of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total colorings of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs without small cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Total Colourings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total coloring of a multigraph with maximal degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total chromatic number of any multigraph with maximum degree five is at most seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings and list total colorings of planar graphs without intersecting 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: (d,1)-total labeling of graphs with a given maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total 9-coloring planar graphs of maximum degree seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total chromatic number of planar graphs with maximum degree ten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2010.07.007 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:41, 9 December 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