Complexity of Coloring Graphs without Forbidden Induced Subgraphs

Daniel Král͏̌; Jan Kratochvı́l; Zsolt Tuza; Gerhard J. Woeginger

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

ScienceGate Book Chapters

BOOK-CHAPTER

Complexity of Coloring Graphs without Forbidden Induced Subgraphs

Daniel Král͏̌Jan Kratochvı́l Zsolt Tuza Gerhard J. Woeginger

Year: 2001 Lecture notes in computer science Pages: 254-262 Publisher: Springer Science+Business Media

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

Get Full-Text PDF Get Analytical Report

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)

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

Complexity of Coloring Graphs without Forbidden Induced Subgraphs

Metrics

Citation History

Topics

Related Documents

Forbidden subgraphs of coloring graphs

Coloring Graphs With Forbidden Almost Bipartite Subgraphs

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs

Triangle-free graphs without forbidden subgraphs

Extremal Graphs without Large Forbidden Subgraphs