Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.disc.2010.05.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079830104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Q3784093 / 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: Q4355071 / 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: Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable / 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: 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-Coloring of Plane Graphs with Maximum Degree Nine / 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: Total colorings and list total colorings of planar graphs without intersecting 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 5-cycles or without 6-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: Q4242734 / 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: 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: On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting 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: On total chromatic number of planar graphs without 4-cycles / 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

Latest revision as of 08:15, 3 July 2024

scientific article
Language Label Description Also known as
English
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
scientific article

    Statements

    Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (English)
    0 references
    0 references
    0 references
    11 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graph
    0 references
    total coloring
    0 references
    maximum degree
    0 references
    cycle
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references