Trestles in polyhedral graphs

Michal Tkáč; Heinz-Jürgen Voss

Discussiones Mathematicae Graph Theory (2002)

  • Volume: 22, Issue: 1, page 193-198
  • ISSN: 2083-5892

How to cite

top

Michal Tkáč, and Heinz-Jürgen Voss. "Trestles in polyhedral graphs." Discussiones Mathematicae Graph Theory 22.1 (2002): 193-198. <http://eudml.org/doc/270718>.

@article{MichalTkáč2002,
author = {Michal Tkáč, Heinz-Jürgen Voss},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {polyhedral graphs; non-Hamiltonian; k-trestle; -trestle},
language = {eng},
number = {1},
pages = {193-198},
title = {Trestles in polyhedral graphs},
url = {http://eudml.org/doc/270718},
volume = {22},
year = {2002},
}

TY - JOUR
AU - Michal Tkáč
AU - Heinz-Jürgen Voss
TI - Trestles in polyhedral graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2002
VL - 22
IS - 1
SP - 193
EP - 198
LA - eng
KW - polyhedral graphs; non-Hamiltonian; k-trestle; -trestle
UR - http://eudml.org/doc/270718
ER -

References

top
  1. [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. Zbl0812.05015
  2. [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. Zbl0958.05085
  3. [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 Zbl0931.05047
  4. [4] V. Chvátal, Tough graphs and Hamiltonian circuits, Discrete Math. 5 (1973) 215-228, doi: 10.1016/0012-365X(73)90138-6. Zbl0256.05122
  5. [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. Zbl0838.05034
  6. [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. Zbl0904.05027
  7. [7] C. Thomassen, A theorem on paths in planar graphs, J. Graph Theory 7 (1983) 169-176, doi: 10.1002/jgt.3190070205. Zbl0515.05040
  8. [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. Zbl0070.18403

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.