Weak-dynamic coloring of graphs beyond-planarity (Q6144496): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00373-023-02733-w / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-023-02733-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4390143963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of different topological representations of graphs beyond-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of 1-Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the 6 color theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing and drawing IC-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard / 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: Graph \(r\)-hued colorings -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for graphs embeddable with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-dynamic coloring of 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: Dynamic coloring of graphs having no \(K_5\) minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on 1-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The colour theorems of Brooks and Gallai extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring plane graphs with independent crossings / 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: Graphs drawn with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Numbers of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing gap \(k\)-planarity is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing complete multipartite graphs on the plane with restrictions on crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic list coloring of 1-planar graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00373-023-02733-W / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:51, 30 December 2024

scientific article; zbMATH DE number 7796524
Language Label Description Also known as
English
Weak-dynamic coloring of graphs beyond-planarity
scientific article; zbMATH DE number 7796524

    Statements

    Weak-dynamic coloring of graphs beyond-planarity (English)
    0 references
    0 references
    0 references
    29 January 2024
    0 references
    weak-dynamic coloring
    0 references
    \(k\)-planar graph
    0 references
    1-planar graph
    0 references
    IC-planar graph
    0 references
    NP-complexity
    0 references
    0 references
    0 references

    Identifiers