Pearls in graph theory : a comprehensive introduction

書誌事項

Pearls in graph theory : a comprehensive introduction

Nora Hartsfield, Gerhard Ringel

Academic Press, c1994

Rev. & Augm

大学図書館所蔵 件 / 30

この図書・雑誌をさがす

注記

Includes bibliographical references and index

内容説明・目次

内容説明

Covers elementary concepts, major topics and theorems in graph theory, with an exposition of some more advanced topics. This edition includes two dozen new exercises, an augmented section on labelling and the simplification of many proofs.

目次

  • Part 1 Basic graph theory: graphs and degrees of vertices
  • subgraphs, isomorphic graphs, trees. Part 2 Colourings of graphs: vertex colourings
  • edge colourings
  • decompositions and Hamilton cycles
  • more decompositions. Part 3 Circuits and cycles: Eulerian circuits
  • the Oberwolfach Problem
  • infinite lattice graphs. Part 4 Extremal problems: a theorem of Turan
  • cages
  • Ramsey theory. Part 5 Counting: counting 1-factors
  • Cayley's Spanning Tree formula
  • more spanning trees. Part 6 Labelling graphs: magic graphs and graceful trees
  • conservative graphs. Part 7 Applications and algorithms: spanning tree algorithms
  • matchings in graphs, scheduling problems
  • binary trees and prefix codes. Part 7 Drawings of graphs: planar graphs
  • the four colour theorem
  • the five colour theorem
  • graphs and geometry. Part 8 Measurements of closeness to planarity: crossing number
  • thickness and splitting number
  • Heawood's Empire Problem. Part 9 Graphs on surfaces: rotations of graphs
  • planar graphs revisited
  • the genus of a graph.

「Nielsen BookData」 より

詳細情報

  • NII書誌ID(NCID)
    BA23164011
  • ISBN
    • 0123285534
  • LCCN
    94005945
  • 出版国コード
    us
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 出版地
    Boston
  • ページ数/冊数
    x, 249 p.
  • 大きさ
    24 cm
  • 分類
  • 件名
ページトップへ