bokomslag Chromatic Graph Theory
Data & IT

Chromatic Graph Theory

Gary Chartrand Ping Zhang

Inbunden

4589:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-11 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

Andra format:

  • 498 sidor
  • 2008
Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex colorings. With historical, applied, and algorithmic discussions, this text offers a solid introduction to one of the most popular areas of graph theory.
  • Författare: Gary Chartrand, Ping Zhang
  • Illustratör: black and white 278 Illustrations
  • Format: Inbunden
  • ISBN: 9781584888000
  • Språk: Engelska
  • Antal sidor: 498
  • Utgivningsdatum: 2008-09-22
  • Förlag: Chapman & Hall/CRC