Crossing Number is NP-hard for Constant Path-width (and Tree-width)

Documenti analoghi

• Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
  di: Hliněný, Petr
  Pubblicazione: (2023)
• Stack and Queue Numbers of Graphs Revisited
  di: Hliněný, Petr, et al.
  Pubblicazione: (2023)
• Hereditary Graph Product Structure and $\cal H$-clique-width
  di: Hliněný, Petr, et al.
  Pubblicazione: (2024)
• Note on Min-k-Planar Drawings of Graphs
  di: Hliněný, Petr, et al.
  Pubblicazione: (2024)
• Minimizing an Uncrossed Collection of Drawings
  di: Hliněný, Petr, et al.
  Pubblicazione: (2023)