Packing Chromatic Number of Distance Graphs Jan Ekstein Premysl Holub

Source URL: orion.math.iastate.edu

• Graph theory
• Graph coloring
• Equitable coloring
• Incidence coloring

Equitable coloring of random graphs Michael Krivelevich1 , Bal´azs Patk´os2 1 Tel Aviv University, Tel Aviv, Israel 2 Central European University, Budapest, Hungary Phenomena in High Dimensions, Samos 2007

Source URL: www.math.aegean.gr

Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology Michael Fellows University of Newcastle, Callaghan, Australia

Source URL: www.mrfellows.net

• NP-complete problems
• Parameterized complexity
• Exponential time hypothesis
• Dominating set
• Tree decomposition
• Vertex cover
• Graph coloring
• Equitable coloring
• Clique
• Theoretical computer science
• Graph theory
• Mathematics

Not So Easy Problems For Tree Decomposable Graphs Stefan Szeider∗

Source URL: www.kr.tuwien.ac.at

• NP-complete problems
• Graph operations
• Tree decomposition
• Minor
• Parameterized complexity
• Dominating set
• Chordal graph
• Equitable coloring
• Clique
• Graph theory
• Theoretical computer science
• Graph coloring

The Eighth International Symposium on Operations Research and Its Applications (ISORA’09) Zhangjiajie, China, September 20–22, 2009 Copyright © 2009 ORSC & APORC, pp. 6–14

Source URL: www.aporc.org

• List coloring
• Acyclic coloring
• Degeneracy
• Equitable coloring
• Outerplanar graph
• Critical graph
• Four color theorem
• Bipartite graph
• Planar graph
• Graph theory
• Graph coloring
• Edge coloring

PDF Document

Source URL: bit-player.org

• Clique
• NP-complete
• Edge coloring
• Equitable coloring
• Graph theory
• Theoretical computer science
• Graph coloring