Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Rothschild, Bruce
1965.
The Decomposition of Graphs into a Finite Number of Paths.
Canadian Journal of Mathematics,
Vol. 17,
Issue. ,
p.
468.
Nash-Williams, C. ST. J. A.
1966.
Euler Lines in Infinite Directed Graphs.
Canadian Journal of Mathematics,
Vol. 18,
Issue. ,
p.
692.
Nash-Williams, C.St.J.A.
1967.
Infinite graphs—A survey.
Journal of Combinatorial Theory,
Vol. 3,
Issue. 3,
p.
286.
Nash-Williams, C. St. J. A.
1971.
Hamiltonian lines in infinite graphs with few vertices of small valency.
Aequationes Mathematicae,
Vol. 7,
Issue. 1,
p.
59.
Nash-Williams, C.St. J. A.
1971.
Recent Trends in Graph Theory.
Vol. 186,
Issue. ,
p.
197.
Bean, Dwight R.
1976.
Recursive Euler and Hamilton paths.
Proceedings of the American Mathematical Society,
Vol. 55,
Issue. 2,
p.
385.
Polat, Norbert
1982.
Sous-graphes traçables des graphes infinis.
Discrete Mathematics,
Vol. 38,
Issue. 2-3,
p.
243.
Eggleton, Roger B.
and
Skilton, Donald K.
1984.
Graph Theory Singapore 1983.
Vol. 1073,
Issue. ,
p.
294.
Skilton, Donald Kenneth
1985.
Chain decompositions of graphs.
Bulletin of the Australian Mathematical Society,
Vol. 31,
Issue. 3,
p.
471.
Skilton, D. K.
1986.
Digraphs with eulerian chains.
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics,
Vol. 41,
Issue. 3,
p.
298.
Diestel, Reinhard
and
Kühn, Daniela
2003.
Graph-theoretical versus topological ends of graphs.
Journal of Combinatorial Theory, Series B,
Vol. 87,
Issue. 1,
p.
197.
Hindman, Neil
2006.
The mathematics of Bruce Rothschild.
Journal of Combinatorial Theory, Series A,
Vol. 113,
Issue. 1,
p.
2.
Bruhn, Henning
and
Stein, Maya
2007.
On end degrees and infinite cycles in locally finite graphs.
Combinatorica,
Vol. 27,
Issue. 3,
p.
269.
Gartside, Paul
and
Pitz, Max
2023.
Eulerian Spaces.
Memoirs of the American Mathematical Society,
Vol. 292,
Issue. 1456,