Infinite Eulerian tessellations
- 作者J.L. Brenner; R.C. Lyndon
- 卷第46卷
- 期第2期
- 印刷ISSN0012-365X
- 文件大小1000.12KB
- 发表时间1983
- DOI10.1016/0012-365x(83)90245-5
- 页码111-132
同作者推荐
Not every 2-tough graph is HamiltonianD. Bauer; H.J. Broersma; H.J. Veldman · 2000
Long cycles, degree sums and neighborhood unionsH.J. Broersma; J.van den Heuvel; H.J. Veldman · 1993
A generalization of Ore's Theorem involving neighborhood unionsH.J. Broersma; J. van den Heuvel; H.J. Veldman · 1993
Long cycles in graphs with prescribed toughness and minimum degreeDouglas Bauer; H.J. Broersma; J. van den Heuvel; H.J. Veldman · 1995
Non-κ-critical vertices in graphsH.J. Veldman · 1983
Derivatives of cycloheptatrienylcyclopentadienyltitaniumH.T. Verkouw; M.E.E. Veldman; C.J. Groenenboom; H.O. Van Oven; H.J. De Leifde Meijer · 1975
On characterization of Hamiltonian graphsC. Hoede; H.J. Veldman · 1978