On longest circuits in certain non-regular planar graphs

Michal Tkáč

Mathematica Slovaca (1995)

  • Volume: 45, Issue: 3, page 235-242
  • ISSN: 0139-9918

How to cite

top

Tkáč, Michal. "On longest circuits in certain non-regular planar graphs." Mathematica Slovaca 45.3 (1995): 235-242. <http://eudml.org/doc/31766>.

@article{Tkáč1995,
author = {Tkáč, Michal},
journal = {Mathematica Slovaca},
keywords = {longest circuits; planar graphs; Hamiltonian graph; 3-polytopial graphs; shortness coefficient},
language = {eng},
number = {3},
pages = {235-242},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {On longest circuits in certain non-regular planar graphs},
url = {http://eudml.org/doc/31766},
volume = {45},
year = {1995},
}

TY - JOUR
AU - Tkáč, Michal
TI - On longest circuits in certain non-regular planar graphs
JO - Mathematica Slovaca
PY - 1995
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 45
IS - 3
SP - 235
EP - 242
LA - eng
KW - longest circuits; planar graphs; Hamiltonian graph; 3-polytopial graphs; shortness coefficient
UR - http://eudml.org/doc/31766
ER -

References

top
  1. EWALD G., KLEINSHMIDT P., PACHNER U., SCHULZ, CH., Neuere Entwicklungen in der kombinatorischen Konvexgeometrie, In: Contributions to Geometry (J. Tolke, J. M. Wills, eds.), Birkhäuser Verlag, Basel, 1979, pp. 131-169. (1979) MR0568497
  2. GRÜNBAUM B., Convex Polytopes, Interscience, New York, 1967. (1967) MR0226496
  3. GRÜNBAUM B., WALTHER H., Shortness exponents offamilies of graphs, J. Combin. Theory Ser. A 14 (1973), 364-385. (1973) MR0314691
  4. HARANT J., WALTHER H., Some new results about the shortness exponent in polyhedral graphs, Časopis Pěst. Mat. 112 (1987), 114-122. (1987) Zbl0642.05039MR0897639
  5. JACKSON B., Longest cycles in 3-connected cubic graphs, J. Combin. Theory Ser. B 41 (1986), 17-26. (1986) Zbl0591.05040MR0854600
  6. JENDROĽ S., TKÁČ M., Convex 3-polytopes with exactly two types of edges, Discrete Math. 84 (1990), 143-160. (1990) Zbl0705.52014MR1071654
  7. JENDROĽ S., KEKEŇÁK R., Longest circuits in triangular and quadrangular 3-polytopes with two types of edges, Math. Slovaca 40 (1990), 341-357. (1990) Zbl0757.05073MR1120965
  8. JENDROĽ S., MIHÓK P., Note on a class of Hamiltonian polytopes, Discrete Math. 71 (1988), 233-241. (1988) MR0959008
  9. OWENS P. J., Simple 3-polytopial graphs with edges of only two types and shortness coefficients, Discrete Math. 59 (1986), 107-114. (1986) MR0837960
  10. OWENS P. J., Non-Hamiltonian simple 3-polytopes with only one type of face besides triangles, In: Ann. Discrete Math. 20, Nоrth-Hоlland, Amsterdam-New Yоrk, 1984, pp. 241-251. (1984) Zbl0571.05033MR0791037
  11. TKÁČ M., Combinatorial properties of certain classes of 3-polytopial planar graphs, In: Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam-New York, 1992, pp. 699-704. (1992) MR1218228

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.