BOOK-CHAPTER

Complexity of Coloring Graphs without Forbidden Induced Subgraphs

Daniel Král͏̌Jan Kratochvı́lZsolt TuzaGerhard J. Woeginger

Year: 2001 Lecture notes in computer science Pages: 254-262   Publisher: Springer Science+Business Media
Keywords:
Graph coloring Combinatorics Computer science Time complexity Greedy coloring Discrete mathematics Characterization (materials science) NP-complete Computational complexity theory Mathematics Graph Algorithm Physics Line graph Graph power

Metrics

191
Cited By
0.82
FWCI (Field Weighted Citation Impact)
8
Refs
0.73
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Graph Labeling and Dimension Problems
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
graph theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

JOURNAL ARTICLE

Forbidden subgraphs of coloring graphs

Francisco AlvaradoAshley ButtsLauren FarquharHeather M. Russell

Journal:   Involve a Journal of Mathematics Year: 2017 Vol: 11 (2)Pages: 311-324
JOURNAL ARTICLE

Coloring Graphs With Forbidden Almost Bipartite Subgraphs

James M. AndersonAnton BernshteynAbhishek Dhawan

Journal:   Random Structures and Algorithms Year: 2025 Vol: 66 (4)
JOURNAL ARTICLE

Triangle-free graphs without forbidden subgraphs

S BRANDT

Journal:   Electronic Notes in Discrete Mathematics Year: 2000 Vol: 3 Pages: 1-1
BOOK-CHAPTER

Extremal Graphs without Large Forbidden Subgraphs

B BollobásP. ErdösMiklós SimonovitsEndre Szemerédi

Annals of discrete mathematics Year: 1978 Pages: 29-41
© 2026 ScienceGate Book Chapters — All rights reserved.