A Glance at Graph Theory-Part II

DOI10.1112/BLMS/14.4.294MaRDI QIDQ3953782zbMATH OpenOpenAlexFDO

Authors 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) Eulerian and Hamiltonian graphs (05C45) Generalized Ramsey theory (05C55) Graph theory (05Cxx)

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953782)