Publication | Closed Access
On the NP-completeness of the k-colorability problem for triangle-free graphs
132
Citations
2
References
1996
Year
Geometric Graph TheoryEngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph TheoryExtremal Graph TheoryPlanar GraphComputational ComplexityK-colorability ProblemComputer ScienceDiscrete MathematicsCombinatorial Optimization
| Year | Citations | |
|---|---|---|
Page 1
Page 1