On the complexity of finding the chromatic number of a recursive graph I: the bounded case - Concepedia

Concepedia

Publication | Closed Access

On the complexity of finding the chromatic number of a recursive graph I: the bounded case

34

Citations

31

References

1989

Year

Richard Beigel, William Gasarch

Annals of Pure and Applied Logic

EngineeringGraph TheoryRecursive GraphAlgebraic Graph TheoryStructural Graph TheoryExtremal Graph TheoryPlanar GraphComputational ComplexityEnumerative CombinatoricsDiscrete MathematicsBounded CaseCombinatorial OptimizationChromatic Number

References

	Year	Citations

Page 1