A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs

Documenti analoghi

• A Graph Width Perspective on Partially Ordered Hamiltonian Paths
  di: Beisegel, Jesse, et al.
  Pubblicazione: (2025)
• A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
  di: Beisegel, Jesse, et al.
  Pubblicazione: (2025)
• Computing Hamiltonian Paths with Partial Order Restrictions
  di: Beisegel, Jesse, et al.
  Pubblicazione: (2024)
• Graph Search Trees and the Intermezzo Problem
  di: Beisegel, Jesse, et al.
  Pubblicazione: (2024)
• The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
  di: Beisegel, Jesse, et al.
  Pubblicazione: (2024)