Chromatic Graph Theory
โ Scribed by Gary Chartrand (Author); Ping Zhang (Author)
- Publisher
- Chapman and Hall/CRC
- Year
- 2008
- Leaves
- 499
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
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-contain
โฆ Table of Contents
The Origin of Graph Colorings. Introduction to Graphs. Trees and Connectivity. Eulerian and Hamiltonian Graphs. Matchings and Factorization. Graph Embeddings. Introduction to Vertex Colorings. Bounds for the Chromatic Number. Coloring Graphs on Surfaces. Restricted Vertex Colorings. Edge Colorings of Graphs. Monochromatic and Rainbow Colorings. Complete Colorings. Distinguishing Colorings. Colorings, Distance, and Domination. Appendix. General References. Bibliography. Index. List of Symbols.
โฆ Subjects
Computer Science;Algorithms & Complexity;Mathematics & Statistics;Advanced Mathematics;Discrete Mathematics;Combinatorics
๐ SIMILAR VOLUMES
Chromatic graph theory is a thriving area that uses various ideas of 'colouring' (of vertices, edges, and so on) to explore aspects of graph theory. It has links with other areas of mathematics, including topology, algebra and geometry, and is increasingly used in such areas as computer networks, wh
Chromatic graph theory is a thriving area that uses various ideas of 'colouring' (of vertices, edges, and so on) to explore aspects of graph theory. It has links with other areas of mathematics, including topology, algebra and geometry, and is increasingly used in such areas as computer networks, wh