Skip to main content
SpringerLink
Log in

The theory of left-right paths

  • Invited Addresses
  • Conference paper
  • First Online:
Combinatorial Mathematics III

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

Abstract

This paper studies the family of cyclic sequences of edges (of a connected plane graph) obtained by walking on edges in such a way that the next edge is, alternately, the one that is leftmost or rightmost with respect to the current edge.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.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

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.-K. Chen, On vector spaces associated with a graph, SIAM J. Appl. Math. 20 (1971) 526–529.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. D. Horton, private communication.

    Google Scholar 

  3. J. Hutchinson, private communication.

    Google Scholar 

  4. G. Kirchhoff, Über die Anflösung der Gleichungen, auf Welche man bei der Untersuchung der linearen Verteilung galvanishe Ströme gefuhrt wird, Annalen der Physik und Chemie, 72 (1847) 497–508.

    Article  Google Scholar 

  5. A. Kotzig, Eulerian lines in finite 4-valent graphs and their transformations, in Theory of Graphs, Proceedings of a colloquium held at Tihany, Hungary, September 1966, P. Erdös and G. Katona, eds., (Academic Press, New York, 1969) 219–230.

    Google Scholar 

  6. S. Maurer, Matrix generalizations of some theorems on trees, cycles and cocycles in graphs, submitted to SIAM J. Appl. Math.

    Google Scholar 

  7. P. Rosenstiehl (in preparation).

    Google Scholar 

  8. H. Shank, Graph property recognition machines, Math. Systems Th. 5 (1971) 44–49.

    MathSciNet  MATH  Google Scholar 

  9. P. Slepian, Mathematical Foundations of Network Analysis, (Springer Tracts in Natural Philosophy, Vol. 16) (Springer Verlag, New York, 1968).

    MATH  Google Scholar 

  10. T. W. Williams and L. M. Maxwell, The decomposition of a graph and the introduction of a new class of subgraphs, SIAM J. Appl. Math. 20 (1971) 385–389.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada

    H. Shank

  2. Faculty of Mathematics, University of Newcastle, New South Wales

    H. Shank

Authors
  1. H. Shank
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anne Penfold Street Walter Denis Wallis

Additional information

To the memory of P. N. Yacullo

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Shank, H. (1975). The theory of left-right paths. In: Street, A.P., Wallis, W.D. (eds) Combinatorial Mathematics III. Lecture Notes in Mathematics, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069542

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07154-9

  • Online ISBN: 978-3-540-37482-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation