The end structure of a graph: recent results and open problems. Diestel, R. Discret. Math., 100(1-3):313-327, 1992.
The end structure of a graph: recent results and open problems. [link]Link  The end structure of a graph: recent results and open problems. [link]Paper  bibtex   
@article{journals/dm/Diestel92,
  added-at = {2020-02-22T00:00:00.000+0100},
  author = {Diestel, Reinhard},
  biburl = {https://www.bibsonomy.org/bibtex/230e175d0c14869c1f10bf153b3d2abc9/dblp},
  ee = {https://doi.org/10.1016/0012-365X(92)90650-5},
  interhash = {e5d36245597990b2ec66ae76ca9726e8},
  intrahash = {30e175d0c14869c1f10bf153b3d2abc9},
  journal = {Discret. Math.},
  keywords = {dblp},
  number = {1-3},
  pages = {313-327},
  timestamp = {2020-02-25T14:02:01.000+0100},
  title = {The end structure of a graph: recent results and open problems.},
  url = {http://dblp.uni-trier.de/db/journals/dm/dm100.html#Diestel92},
  volume = 100,
  year = 1992
}

Downloads: 0