Graph coloring problems
Author(s)
Bibliographic Information
Graph coloring problems
(Wiley-Interscience series in discrete mathematics and optimization)
Wiley, c1995
Available at 44 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"A Wiley-Interscience publication"
Includes bibliographical references and indexes
Description and Table of Contents
Description
Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and help avoid efforts on solving already settled problems. Each chapter concludes with a comprehensive list of references which will lead readers to original sources, important contributions and other surveys.
Table of Contents
Planar Graphs.
Graphs on Higher Surfaces.
Degrees.
Critical Graphs.
The Conjectures of Hadwiger and Hajos.
Sparse Graphs.
Perfect Graphs.
Geometric and Combinatorial Graphs.
Algorithms.
Constructions.
Edge Colorings.
Orientations and Flows.
Chromatic Polynomials.
Hypergraphs.
Infinite Chromatic Graphs.
Miscellaneous Problems.
Indexes.
by "Nielsen BookData"