"On the NP-completeness of the k-colorability problem for triangle-free graphs."

Frédéric Maffray, Myriam Preissmann (1996)

Details and statistics

DOI: 10.1016/S0012-365X(97)89267-9

access: open

type: Journal Article

metadata version: 2021-02-12