Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges

Documenti analoghi

• Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
  di: Bok, Jan, et al.
  Pubblicazione: (2025)
• Computational complexity of covering regular trees
  di: Bok, Jan, et al.
  Pubblicazione: (2025)
• Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
  di: Jedličková, Nikola, et al.
  Pubblicazione: (2023)
• On the expressive power of $2$-edge-colourings of graphs
  di: Bok, Jan, et al.
  Pubblicazione: (2025)
• On the Structure of Hamiltonian Graphs with Small Independence Number
  di: Jedličková, Nikola, et al.
  Pubblicazione: (2024)