Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jedličková, Nikola, Kratochvíl, Jan
Format:	Preprint
Published:	2023
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2309.09228