Amazon cover image
Image from Amazon.com

Advances in graph theory / edited by B. Bollobás.

By: Contributor(s): Series: Annals of discrete mathematics ; 3.1978Description: 1 online resource (vii, 295 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780720408430
  • 0720408431
  • 9780080867663
  • 0080867669
Subject(s): Genre/Form: Additional physical formats: Print version:: Advances in graph theory.LOC classification:
  • QA166 .C35 1977eb
Online resources:
Contents:
Front Cover; Annals of Discrete Mathematics; Copyright Page; Foreword; CONTENTS; Chapter 1. Linear separation of dominating sets in graphs; Chapter 2. Regularisable graphs; Chapter 3. Hamiltonian decompositions of graphs, directed graphs and hypergraphs; Chapter 4. Extrernal graphs without large forbidden subgraphs; Chapter 5. Hamiltonian cycles in regular graphs; Chapter 6. The chromatic index of the graph of the assignment polytope; Chapter 7. Loopy games; Chapter 8. Hamilton circuits and long circuits; Chapter 9. Simplicial decompositions of infinite graphs.
Action note:
  • digitized 2010 HathiTrust Digital Library committed to preserve
Item type: eBooks
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Consists chiefly of papers presented at the Cambridge Combinatorial Conference held at Trinity College, May 12-14, 1977 under the auspices of the Dept. of Pure Mathematics and Mathematical Statistics.

Includes bibliographical references.

Print version record.

Front Cover; Annals of Discrete Mathematics; Copyright Page; Foreword; CONTENTS; Chapter 1. Linear separation of dominating sets in graphs; Chapter 2. Regularisable graphs; Chapter 3. Hamiltonian decompositions of graphs, directed graphs and hypergraphs; Chapter 4. Extrernal graphs without large forbidden subgraphs; Chapter 5. Hamiltonian cycles in regular graphs; Chapter 6. The chromatic index of the graph of the assignment polytope; Chapter 7. Loopy games; Chapter 8. Hamilton circuits and long circuits; Chapter 9. Simplicial decompositions of infinite graphs.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [S.l.] : HathiTrust Digital Library, 2010. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL

Elsevier ScienceDirect All Books

Copyright © 2020 Alfaisal University Library. All Rights Reserved.
Tel: +966 11 2158948 Fax: +966 11 2157910 Email:
librarian@alfaisal.edu