Skip to main content Accessibility help
×
Home

Decomposition of Graphs into Two-Way Infinite Paths

  • C. ST. J. A. Nash-Williams (a1)

Extract

We consider undirected graphs in which two vertices may be joined by more than one edge and in which a vertex may be joined to itself by one or more edges. G will always denote a graph. The set of vertices [edges] of G will be denoted by V(G) [E(G)]. G is finite or infinite according as V(G) ∪ E(G) is finite or infinite. The degree, d(ξ) or dG (ξ), of a vertex ξ of G is 2a + b, where a is the number of edges joining ξ to itself and b is the number of those joining ξ to other vertices.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Decomposition of Graphs into Two-Way Infinite Paths
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Decomposition of Graphs into Two-Way Infinite Paths
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Decomposition of Graphs into Two-Way Infinite Paths
      Available formats
      ×

Copyright

References

Hide All
1. St, C.. J. A. Nash-Williams, Decomposition of graphs into closed and endless chains, Proc London Math. Soc. (3), 10 (1960), 221238.
2. St, C.. Nash-Williams, J. A., Decomposition of graphs into infinite chains (thesis, Cambridge, 1958).
3. Ore, O., Theory of graphs (Providence, 1962).
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Decomposition of Graphs into Two-Way Infinite Paths

  • C. ST. J. A. Nash-Williams (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed