@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1168,
author = {Michal Tk\'a\v c and Heinz-J\"urgen Voss},
title = {Trestles in polyhedral graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {22},
year = {2002},
pages = {193-198},
zbl = {1012.05096},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1168}
}
Michal Tkáč; Heinz-Jürgen Voss. Trestles in polyhedral graphs. Discussiones Mathematicae Graph Theory, Tome 22 (2002) pp. 193-198. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1168/
[000] [1] D. Barnette, 2-connected spanning subgraphs of planar 3-connected graphs, J. Combin. Theory (B) 61 (1994) 210-216, doi: 10.1006/jctb.1994.1045. | Zbl 0812.05015
[001] [2] T. Böhme and J. Harant, On hamiltonian cycles in 4- and 5-connected planar triangulations, Discrete Math. 191 (1998) 25-30, doi: 10.1016/S0012-365X(98)00089-2. | Zbl 0958.05085
[002] [3] T. Böhme, J. Harant and M. Tkáč, On certain Hamiltonian cycles in planar graphs, J. Graph Theory 32 (1999) 81-96, doi: 10.1002/(SICI)1097-0118(199909)32:1<81::AID-JGT8>3.0.CO;2-9 | Zbl 0931.05047
[003] [4] V. Chvátal, Tough graphs and Hamiltonian circuits, Discrete Math. 5 (1973) 215-228, doi: 10.1016/0012-365X(73)90138-6. | Zbl 0256.05122
[004] [5] Z. Gao, 2-connected coverings of bounded degree in 3-connected graphs, J. Graph Theory 20 (1995) 327-338, doi: 10.1002/jgt.3190200309. | Zbl 0838.05034
[005] [6] D.P. Sanders and Y. Zhao, On 2-connected spanning subgraphs with low maximum degree, J. Combin. Theory (B) 74 (1998) 64-86, doi: 10.1006/jctb.1998.1836. | Zbl 0904.05027
[006] [7] C. Thomassen, A theorem on paths in planar graphs, J. Graph Theory 7 (1983) 169-176, doi: 10.1002/jgt.3190070205. | Zbl 0515.05040
[007] [8] W.T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956) 99-116, doi: 10.1090/S0002-9947-1956-0081471-8. | Zbl 0070.18403