Optimal \(r\)-dynamic coloring of sparse graphs (Q2424825): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/s10878-019-00387-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2915468158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal square coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex arboricity of planar graphs without intersecting 5-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dynamic coloring for planar graphs and graphs of higher genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The entire chromatic number of graphs embedded on the torus with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-dynamic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-distance vertex-distinguishing index of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic coloring and list dynamic coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-hued coloring of \(K_4\)-minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-hued coloring of planar graphs with girth at least 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum choosability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without chordal 5-cycles are 2-good / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge coloring of planar graphs without adjacent 7-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for adjacent vertex-distinguishing edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum 2-distance coloring of planar graphs and channel assignment / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:13, 19 July 2024

scientific article
Language Label Description Also known as
English
Optimal \(r\)-dynamic coloring of sparse graphs
scientific article

    Statements

    Optimal \(r\)-dynamic coloring of sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    girth
    0 references
    sparse graph
    0 references
    \(r\)-dynamic coloring
    0 references

    Identifiers