Weak-dynamic coloring of graphs beyond-planarity

DOI10.1007/S00373-023-02733-WMaRDI QIDQ6144496zbMATH OpenOpenAlexFDO

Authors Weichan Liu, Guiying 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 graph\(k\)-planar graphIC-planar graphNP-complexityweak-dynamic coloring

Mathematics Subject Classification ID

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

Recommendations

• Weak dynamic coloring of planar graphs
• Dynamic coloring and list dynamic coloring of planar graphs
• Dynamic list coloring of 1-planar graphs
• Adynamic coloring of graphs
• A weak DP-coloring of planar graphs without 4- and 9-cycles

Cites work

• A new proof of the 6 color theorem
• Adding one edge to planar graphs makes crossing number and 1-planarity hard
• Algorithms for graphs embeddable with few crossings per edge
• An annotated bibliography on 1-planarity
• Coloring plane graphs with independent crossings
• Conditional colorings of graphs
• Crossing numbers of graphs
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• Dynamic coloring and list dynamic coloring of planar graphs
• Dynamic coloring of graphs having no \(K_5\) minor
• Dynamic list coloring of 1-planar graphs
• Efficient generation of different topological representations of graphs beyond-planarity
• Ein Sechsfarbenproblem auf der Kugel
• Graph \(r\)-hued colorings -- a survey
• Graphs drawn with few crossings per edge
• scientific article; zbMATH DE number 3900784 (Why is no real title available?)
• scientific article; zbMATH DE number 2197944 (Why is no real title available?)
• On \(r\)-dynamic coloring of graphs
• On dynamic coloring for planar graphs and graphs of higher genus
• Parameterized complexity of 1-planarity
• Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
• Testing gap \(k\)-planarity is NP-complete
• The colour theorems of Brooks and Gallai extended

Cited in

(4)

• Weak dynamic coloring of planar graphs
• Equitable coloring of graphs beyond planarity
• Dynamic coloring of IC-planar graphs
• On proper conflict-free colorings of IC-planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144496)