Accessibility and Ends of Graphs
- 作者Rögnvaldur G. Möller
- 卷第66卷
- 期第2期
- 印刷ISSN0095-8956
- 电子ISSN1096-0902
- 文件大小336.60KB
- 发表时间1996
- DOI10.1006/jctb.1996.0023
- 页码303-309
同作者推荐
Cycles in digraphs– a surveyJ. C. Bermond; C. Thomassen · 1981
Vertex-Transitive Graphs and AccessibilityC. Thomassen; W. Woess · 1993
Five-Coloring Maps on SurfacesC. Thomassen · 1993
Trees in TriangulationsC. Thomassen · 1994
Every Planar Graph Is 5-ChoosableC. Thomassen · 1994
Chromatic Roots and Hamiltonian PathsC. Thomassen · 2000
Highly Symmetric Subgraphs of HypercubesA.E. Brouwer; I.J. Dejter; C. Thomassen · Journal of Algebraic Combinatorics · 1993
Edge sets contained in circuitsK. B. Reid; C. Thomassen · 1976