Skip to main content

The theory of left-right paths

Invited Addresses

Part of the Lecture Notes in Mathematics book series (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.

Keywords

  • Span Tree
  • Plane Graph
  • Vertex Labelling
  • Cyclic Sequence
  • Simple Closed Curf

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about 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.

    CrossRef  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.

    CrossRef  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.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

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