Updating the complexity status of coloring graphs without a fixed induced linear forest - Concepedia

Concepedia

Publication | Open Access

Updating the complexity status of coloring graphs without a fixed induced linear forest

DOI Full Paper Access

64

Citations

16

References

2011

Year

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Theoretical Computer Science

Graph MinorComplexity StatusEngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph TheoryExtremal Graph TheoryComputational ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationGraph Algorithm

References

	Year	Citations

Page 1