Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jaworska, Justyna, Kielak, Bartłomiej, Masařík, Tomáš, Masaříková, Jana
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Discrete Mathematics Combinatorics 05C15, 05C85
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2509.02423