Skip to main content
SpringerLink
Log in

Cycles and Rays

  • Book
  • © 1990

Overview

Editors:
  1. Geňa Hahn

    1. Département d’Informatique et de Recherche Opérationnelle, Université de Montréal, Montréal, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gert Sabidussi

    1. Département de Mathématiques et de Statistique, Université de Montréal, Montréal, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Robert E. Woodrow

    1. Department of Mathematics and Statistics, University of Calgary, Calgary, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Nato Science Series C: (ASIC, volume 301)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 chapters)

  1. Front Matter

    Pages iii-iii
    Download chapter PDF

  2. Linkability in Countable-Like Webs

    • R. Aharoni
    Pages 1-8

  3. Decomposition into Cycles I: Hamilton Decompositions

    • B. Alspach, J.-C. Bermond, D. Sotteau
    Pages 9-18

  4. An Order- and Graph-Theoretical Characterisation of Weakly Compact Cardinals

    • G. D. Badenhorst, T. Sturm
    Pages 19-20

  5. Small Cycle Double Covers of Graphs

    • J. A. Bondy
    Pages 21-40

  6. κ-Transformations, Local Complementations and Switching

    • A. Bouchet
    Pages 41-50

  7. Two Extremal Problems in Infinite Ordered Sets and Graphs: Infinite Versions of Menger and Gallai-Milgram Theorems for Ordered Sets and Graphs

    • J. M. Brochet, M. Pouzet
    Pages 51-74

  8. Chvátal-Erdös Theorem For Digraphs

    • N. Chakroun, D. Sotteau
    Pages 75-86

  9. Long Cycles and the Codiameter of a Graph II

    • G. Fan
    Pages 87-94

  10. Compatible Euler Tours In Eulerian Digraphs

    • H. Fleischner, B. Jackson
    Pages 95-100

  11. Edge-Colouring Graphs and Embedding Partial Triple Systems of Even Index

    • J. W. Hilton, C. A. Rodger
    Pages 101-112

  12. On the Rank of Fixed Point Sets of Automorphisms of Free Groups

    • W. Imrich, S. Krstic, E. C. Turner
    Pages 113-122

  13. On Transition Polynomials of 4-Regular Graphs

    • F. Jaeger
    Pages 123-150

  14. On Infinite n-Connected Graphs

    • W. Mader
    Pages 151-160

  15. Ordered Graphs Without Infinite Paths

    • E. C. Milner
    Pages 161-180

  16. Ends of Infinite Graphs, Potential Theory and Electrical Networks

    • M. A. Picardello, W. Woess
    Pages 181-196

  17. Topological Aspects of Infinite Graphs

    • N. Polat
    Pages 197-220

  18. Dendroids, End-Separators, and Almost Circuit-Connected Trees

    • G. Sabidussi
    Pages 221-236

  19. Partition Theorems for Graphs Respecting the Chromatic Number

    • N. Sauer, M. El-Zahar
    Pages 237-242

  20. Vertex-Transitive Graphs That Are Not Cayley Graphs

    • Mark E. Watkins
    Pages 243-256
Back to top

Keywords

About this book

What is the "archetypal" image that comes to mind when one thinks of an infinite graph? What with a finite graph - when it is thought of as opposed to an infinite one? What structural elements are typical for either - by their presence or absence - yet provide a common ground for both? In planning the workshop on "Cycles and Rays" it had been intended from the outset to bring infinite graphs to the fore as much as possible. There never had been a graph theoretical meeting in which infinite graphs were more than "also rans", let alone one in which they were a central theme. In part, this is a matter of fashion, inasmuch as they are perceived as not readily lending themselves to applications, in part it is a matter of psychology stemming from the insecurity that many graph theorists feel in the face of set theory - on which infinite graph theory relies to a considerable extent. The result is that by and large, infinite graph theorists know what is happening in finite graphs but not conversely. Lack of knowledge about infinite graph theory can also be found in authoritative l sources. For example, a recent edition (1987) of a major mathematical encyclopaedia proposes to ". . . restrict [itself] to finite graphs, since only they give a typical theory". If anything, the reverse is true, and needless to say, the graph theoretical world knows better. One may wonder, however, by how much.

Editors and Affiliations

  • Département d’Informatique et de Recherche Opérationnelle, Université de Montréal, Montréal, Canada

    Geňa Hahn

  • Département de Mathématiques et de Statistique, Université de Montréal, Montréal, Canada

    Gert Sabidussi

  • Department of Mathematics and Statistics, University of Calgary, Calgary, Canada

    Robert E. Woodrow

Bibliographic Information

  • Book Title: Cycles and Rays

  • Editors: Geňa Hahn, Gert Sabidussi, Robert E. Woodrow

  • Series Title: Nato Science Series C:

  • DOI: https://doi.org/10.1007/978-94-009-0517-7

  • Publisher: Springer Dordrecht

  • eBook Packages: Springer Book Archive

  • Copyright Information: Kluwer Academic Publishers 1990

  • Hardcover ISBN: 978-0-7923-0597-2Due: 31 December 1989

  • Softcover ISBN: 978-94-010-6719-5Published: 20 September 2011

  • eBook ISBN: 978-94-009-0517-7Published: 06 December 2012

  • Series ISSN: 1389-2185

  • Edition Number: 1

  • Number of Pages: 276

  • Topics: Combinatorics, Probability Theory and Stochastic Processes, Theory of Computation

Publish with us

Policies and ethics

Back to top

Search

Navigation