January 01, 2001 conference-paper Complexity of Coloring Graphs without Forbidden Induced Subgraphs Lecture notes in computer science DOI: 10.1007/3-540-45477-2_23 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 192 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs 2020 SIAM Journal on Discrete Mathematics article Computer Science Advanced Graph Theory Research Open access 9 citations 1 result References 0