Acyclic total colorings of planar graphs without \(l\) cycles (Q475741): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-011-8640-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068087335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic coloring of graphs of maximum degree five: nine colors are enough / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of acyclic edge colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: About acyclic edge colourings of planar graphs / 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 colourings of graphs / 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: Total colorings of planar graphs without adjacent triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic total colorings of planar graphs without \(l\) cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-color theorem on plane graphs without 5-circuits / rank
 
Normal rank

Latest revision as of 09:24, 9 July 2024

scientific article
Language Label Description Also known as
English
Acyclic total colorings of planar graphs without \(l\) cycles
scientific article

    Statements

    Acyclic total colorings of planar graphs without \(l\) cycles (English)
    0 references
    0 references
    0 references
    27 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    acyclic total coloring
    0 references
    cycle
    0 references
    planar graph
    0 references
    0 references