Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ding-Zhu Du / rank
 
Normal rank
Property / author
 
Property / author: Ying Qian Wang / 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.2009.02.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037254958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: 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: Total-Coloring of Plane Graphs with Maximum Degree Nine / 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 without adjacent triangles / 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: On total chromatic number of planar graphs without 4-cycles / rank
 
Normal rank

Latest revision as of 19:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
scientific article

    Statements

    Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2010
    0 references
    0 references
    planar graph
    0 references
    total coloring
    0 references
    maximum degree
    0 references
    adjacent triangles
    0 references
    0 references