Total colorings of planar graphs without intersecting 5-cycles (Q444447): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.03.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041620391 / 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: 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: Local condition for planar graphs of maximum degree 7 to be 8-totally colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total coloring of planar graphs without 6-cycles / 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: Total colorings and list total colorings of planar graphs without intersecting 4-cycles / 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 coloring of planar graphs without chordal short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total coloring of planar graphs without adjacent short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total coloring of planar graphs with maximum degree \(7\) / 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 14:08, 5 July 2024

scientific article
Language Label Description Also known as
English
Total colorings of planar graphs without intersecting 5-cycles
scientific article

    Statements

    Total colorings of planar graphs without intersecting 5-cycles (English)
    0 references
    0 references
    0 references
    14 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    total coloring
    0 references
    planar graph
    0 references
    cycle
    0 references
    0 references