Skip to main content
SpringerLink
Log in
Book cover

Theory and Applications of Graphs

Proceedings, Michigan, May 11 - 15, 1976

  • Conference proceedings
  • © 1978

Overview

Editors:
  1. Yousef Alavi

    1. Department of Mathematics, Western Michigan University, Kalamazoo, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Don R. Lick

    1. Department of Mathematics, Western Michigan University, Kalamazoo, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Mathematics (LNM, volume 642)

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 59.00
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 (57 papers)

  1. Pruning and depth first search

    • Gary Haggard
    Pages 216-224

  2. Graphs and their degree sequences: A survey

    • S. Louis Hakimi, Edward F. Schmeichel
    Pages 225-235

  3. The bichromaticity of a tree

    • Frank Harary, Derbiau Hsu, Zevi Miller
    Pages 236-246

  4. On diameter stability of graphs

    • Jehuda Hartman, Izhak Rubin
    Pages 247-254

  5. Generalized pseudosurface embeddings of graphs and associated block designs

    • Clare E. Heidema
    Pages 255-270

  6. Powers of graphs, line graphs, and total graphs

    • Arthur M. Hobbs
    Pages 271-285

  7. The cartesian product of two graphs is stable

    • D. A. Holton, J. Sims
    Pages 286-303

  8. A note on a generalized regularity condition

    • Joan P. Hutchinson, Sue H. Whitesides
    Pages 304-308

  9. Long and short walks in trees

    • Paul C. Kainen
    Pages 309-313

  10. Random clumps, graphs, and polymer solutions

    • J. W. Kennedy
    Pages 314-329

  11. Mixed ramsey numbers: Edge chromatic numbers vs. graphs

    • Linda M. Lesniak, Albert D. Polimeni, Donald W. VanderJagt
    Pages 330-341

  12. Planar and outerplanar cayley graphs of free groups

    • H. W. Levinson
    Pages 342-346

  13. Coloring restrictions

    • Roy B. Levow
    Pages 347-352

  14. If a hadamard matrix of order 24 has character exactly 2, its transpose is known

    • Judith Q. Longyear
    Pages 353-363

  15. Cycle lengths in polytopal graphs

    • Joseph Malkevitch
    Pages 364-370

  16. Subgraph connectivity numbers of a graph

    • David W. Matula
    Pages 371-383

  17. Matchings in graphs III: Infinite graphs

    • P. J. McCarthy
    Pages 384-393

  18. Steinhaus graphs

    • John C. Molluzzo
    Pages 394-402

  19. Packing and covering constants for recursive trees

    • A. Meir, J. W. Moon
    Pages 403-411

  20. The minimum degree and connectivity of a graph

    • Ladislav Nebeský
    Pages 412-419
Back to top

Keywords

Editors and Affiliations

  • Department of Mathematics, Western Michigan University, Kalamazoo, USA

    Yousef Alavi, Don R. Lick

Bibliographic Information

  • Book Title: Theory and Applications of Graphs

  • Book Subtitle: Proceedings, Michigan, May 11 - 15, 1976

  • Editors: Yousef Alavi, Don R. Lick

  • Series Title: Lecture Notes in Mathematics

  • DOI: https://doi.org/10.1007/BFb0070359

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1978

  • Softcover ISBN: 978-3-540-08666-6Published: 01 April 1978

  • eBook ISBN: 978-3-540-35912-8Published: 14 November 2006

  • Series ISSN: 0075-8434

  • Series E-ISSN: 1617-9692

  • Edition Number: 1

  • Number of Pages: XIV, 638

  • Topics: Graph Theory

Publish with us

Policies and ethics

Back to top

Search

Navigation