Total coloring of planar graphs without 6-cycles (Q617651): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jian-Feng Hou / rank
Normal rank
 
Property / author
 
Property / author: Gui Zhen Liu / rank
Normal rank
 
Property / author
 
Property / author: Jian-Feng Hou / rank
 
Normal rank
Property / author
 
Property / author: Gui Zhen Liu / 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.dam.2010.08.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3022267896 / 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: Total colorings of planar graphs with large maximum degree / 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: Total colorings of planar graphs without small cycles / 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: List edge and list total colorings of planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of certain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the total colouring number is NP-hard / 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: On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs with maximum degree at least 8 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs without adjacent triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Total Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564127 / 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: A note on total colorings of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of graphs / rank
 
Normal rank

Revision as of 16:17, 3 July 2024

scientific article
Language Label Description Also known as
English
Total coloring of planar graphs without 6-cycles
scientific article

    Statements

    Total coloring of planar graphs without 6-cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 January 2011
    0 references
    planar graph
    0 references
    cycle
    0 references
    total coloring
    0 references
    total chromatic number
    0 references

    Identifiers