Work

Complexity of Coloring Graphs without Forbidden Induced Subgraphs

Year: 2001

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-45477-2_23

Authors: Daniel Král’, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger

Institutions: Charles University, HUN-REN Institute for Computer Science and Control, Hungarian Academy of Sciences, Graz University of Technology

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1882281809

FWCI: 0.48

Cites: 8

Cited by: 188

Related to: 10