Los siguientes grafos son completos. Deben obtener siempre esa cantidad de colores con Greedy en cualquier orden.
X(G)=100
X(G)=500
X(G)=1000
-
Notifications
You must be signed in to change notification settings - Fork 0
Project's Graphs of MDII
License
shirosweets/KGraphs
About
Project's Graphs of MDII
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published