Weak-dynamic coloring of graphs beyond-planarity

DOI10.1007/s00373-023-02733-wOpenAlexW4390143963MaRDI QIDQ6144496

Weichan Liu, Gui Ying Yan

Publication date: 29 January 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-023-02733-w

zbMATH Keywords

1-planar graphNP-complexityIC-planar graph\(k\)-planar graphweak-dynamic coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On \(r\)-dynamic coloring of graphs
• Dynamic coloring of graphs having no \(K_5\) minor
• Recognizing and drawing IC-planar graphs
• On dynamic coloring for planar graphs and graphs of higher genus
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• Graphs drawn with few crossings per edge
• The colour theorems of Brooks and Gallai extended
• Testing gap \(k\)-planarity is NP-complete
• Graph \(r\)-hued colorings -- a survey
• Efficient generation of different topological representations of graphs beyond-planarity
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• Dynamic coloring and list dynamic coloring of planar graphs
• Algorithms for graphs embeddable with few crossings per edge
• Conditional colorings of graphs
• Dynamic list coloring of 1-planar graphs
• Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
• Coloring plane graphs with independent crossings
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• Crossing Numbers of Graphs
• Parameterized Complexity of 1-Planarity
• A new proof of the 6 color theorem
• Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard

This page was built for publication: Weak-dynamic coloring of graphs beyond-planarity