Skip to main content Accessibility help
×
  • Cited by 18
    • Show more authors
    • Access check Access
      You have digital access to this book
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      05 May 2015
      07 May 2015
      ISBN:
      9781139519793
      9781107033504
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      0.72kg, 386 Pages
      Dimensions:
      Weight & Pages:
    Access check Access
    You have digital access to this book
    Selected: Digital
    Add to cart View cart Buy from Cambridge.org

    Book description

    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, where colouring algorithms form an important feature. While other books cover portions of the material, no other title has such a wide scope as this one, in which acknowledged international experts in the field provide a broad survey of the subject. All fifteen chapters have been carefully edited, with uniform notation and terminology applied throughout. Bjarne Toft (Odense, Denmark), widely recognized for his substantial contributions to the area, acted as academic consultant. The book serves as a valuable reference for researchers and graduate students in graph theory and combinatorics and as a useful introduction to the topic for mathematicians in related fields.

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    ×

    Contents

    • Frontmatter
      pp i-vi
    • Contents
      pp vii-xii
    • Foreword
      pp xiii-xiv
    • Preface
      pp xv-xvi
    • Preliminaries
      pp 1-12
    • 1 - Colouring graphs on surfaces
      pp 13-35
    • 2 - Brooks's theorem
      pp 36-55
    • 3 - Chromatic polynomials
      pp 56-72
    • 4 - Hadwiger's conjecture
      pp 73-93
    • 5 - Edge-colourings
      pp 94-113
    • 6 - List-colourings
      pp 114-136
    • 7 - Perfect graphs
      pp 137-160
    • 8 - Geometric graphs
      pp 161-180
    • 9 - Integer flows and orientations
      pp 181-198
    • 10 - Colouring random graphs
      pp 199-229
    • 11 - Hypergraph colouring
      pp 230-254
    • 12 - Chromatic scheduling
      pp 255-276
      • By Dominique de Werra, Ecole Polytechnique Fédérale de Lausanne in Switzerland, Alain Hertz, École Polytechnique Fédérale de Lausanne in Switzerland
    • 13 - Graph colouring algorithms
      pp 277-303
    • 14 - Colouring games
      pp 304-326
    • 15 - Unsolved graph colouring problems
      pp 327-357
    • Notes on contributors
      pp 358-362
    • Index
      pp 363-370

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.