Characterization of cycle obstruction sets for improper coloring planar graphs

Documenti analoghi

• Between proper and square colorings of sparse graphs
  di: Choi, Ilkyoo, et al.
  Pubblicazione: (2025)
• The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
  di: Ahn, Jungho, et al.
  Pubblicazione: (2022)
• Note on Hamiltonicity of basis graphs of even delta-matroids
  di: Kim, Donggyu, et al.
  Pubblicazione: (2023)
• Prime vertex-minors of a prime graph
  di: Kim, Donggyu, et al.
  Pubblicazione: (2022)
• Blind cop-width and balanced minors of graphs
  di: Buffière, Hector, et al.
  Pubblicazione: (2025)