[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 2204 || Complexity of Coloring Graphs without Forbidden Induced Subgraphs
✍ Scribed by Brandstädt, Andreas; Le, Van Bang
- Book ID
- 120638080
- Publisher
- Springer Berlin Heidelberg
- Year
- 2001
- Tongue
- English
- Weight
- 151 KB
- Edition
- 1
- Category
- Article
- ISBN
- 3540454772
No coin nor oath required. For personal study only.
✦ Synopsis
This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001. The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields.
📜 SIMILAR VOLUMES
Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.). Includes Bibliographical References And Index. Also Issued Online.
The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zar´ os, Crete, Greece, June 28–30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japa
The 29th International Workshop on Graph-Theoretic Concepts in Computer Science(WG2003)washeldintheMennorodeconferenceCenterinElspeet,The Netherlands.TheworkshopwasorganizedbytheCenterforAlgorithmicSystems of the Institute of Information and Computing Sciences of Utrecht University. The workshop too