Between proper and square coloring of planar graphs, hardness and extremal graphs

Ähnliche Einträge

• Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
  von: Bonomo-Braberman, Flavia, et al.
  Veröffentlicht: (2025)
• $C_{2k+1}$-coloring of bounded-diameter graphs
  von: Piecyk, Marta
  Veröffentlicht: (2024)
• Between proper and square colorings of planar graphs with maximum degree at most four
  von: Liu, Xujun, et al.
  Veröffentlicht: (2026)
• The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
  von: Ahn, Jungho, et al.
  Veröffentlicht: (2022)
• On the hardness of recognizing graphs of small mim-width and its variants
  von: la Tour, Max Dupré, et al.
  Veröffentlicht: (2025)