Rankings
Publications
Sources
Publishers
Scholars
Organizations
About
Login
Register
Home
Publications
An O(n2) algorithm to color Meyniel graphs
Home
Publications
An O(n2) algorithm to color Meyniel graphs
An O(n2) algorithm to color Meyniel graphs
F. Roussel
F. Roussel
IR
I. Rusu
I. Rusu
Publisher Website
Google Scholar
Cite
Download
Share
Download
Download
Download PDF
Download
28 May 2001
journal article
Published by
Elsevier BV
in
Discrete Mathematics
Vol. 235
(1-3)
,
107-123
https://doi.org/10.1016/s0012-365x(00)00264-8
Abstract
No abstract available
Keywords
COLORING
EVEN PAIR
GREEDY ALGORITHM
PERFECT GRAPHS
Cited by 8 articles