A Glance at Graph Theory-Part II

DOI10.1112/blms/14.4.294zbMath0492.05024OpenAlexW4234281422MaRDI QIDQ3953782

C. St. J. A. Nash-Williams

Publication date: 1982

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/14.4.294

zbMATH Keywords

Hamilton paths and circuitsunsolved problems in graph theory

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Generalized Ramsey theory (05C55) Eulerian and Hamiltonian graphs (05C45) Graph theory (05Cxx)

Related Items (9)

On well-quasi-ordering-finite graphs by immersion ⋮ On immersions of uncountable graphs ⋮ Splitter theorems for 4-regular graphs ⋮ Reconstruction of infinite graphs ⋮ On self‐immersions of infinite graphs ⋮ Hamilton-decomposable graphs and digraphs of infinite valence ⋮ Reconstructing the number of blocks of an infinite graph ⋮ A note on subdigraphs of digraphs with large outdegrees ⋮ On the immersion relation and an embedding problem for infinite graphs

This page was built for publication: A Glance at Graph Theory-Part II