Geodesic
On longest circuits in certain non-regular planar graphs
Mathematica slovaca, Tome 45 (1995) no. 3, pp. 235-242
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C38, 52B05, 52B10 
@article{MASLO_1995_45_3_a2,
     author = {Tk\'a\v{c}, Michal},
     title = {On longest circuits in certain non-regular planar graphs},
     journal = {Mathematica slovaca},
     pages = {235--242},
     year = {1995},
     volume = {45},
     number = {3},
     mrnumber = {1361816},
     zbl = {0852.05057},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1995_45_3_a2/}
}
TY  - JOUR
AU  - Tkáč, Michal
TI  - On longest circuits in certain non-regular planar graphs
JO  - Mathematica slovaca
PY  - 1995
SP  - 235
EP  - 242
VL  - 45
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MASLO_1995_45_3_a2/
LA  - en
ID  - MASLO_1995_45_3_a2
ER  - 
%0 Journal Article
%A Tkáč, Michal
%T On longest circuits in certain non-regular planar graphs
%J Mathematica slovaca
%D 1995
%P 235-242
%V 45
%N 3
%U http://geodesic.mathdoc.fr/item/MASLO_1995_45_3_a2/
%G en
%F MASLO_1995_45_3_a2
Tkáč, Michal. On longest circuits in certain non-regular planar graphs. Mathematica slovaca, Tome 45 (1995) no. 3, pp. 235-242. http://geodesic.mathdoc.fr/item/MASLO_1995_45_3_a2/

[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. | MR

[2] GRÜNBAUM B.: Convex Polytopes. Interscience, New York, 1967. | MR

[3] GRÜNBAUM B., WALTHER H.: Shortness exponents offamilies of graphs. J. Combin. Theory Ser. A 14 (1973), 364-385. | MR

[4] HARANT J., WALTHER H.: Some new results about the shortness exponent in polyhedral graphs. Časopis Pěst. Mat. 112 (1987), 114-122. | MR | Zbl

[5] JACKSON B.: Longest cycles in 3-connected cubic graphs. J. Combin. Theory Ser. B 41 (1986), 17-26. | MR | Zbl

[6] JENDROĽ S., TKÁČ M.: Convex 3-polytopes with exactly two types of edges. Discrete Math. 84 (1990), 143-160. | MR | Zbl

[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. | MR | Zbl

[8] JENDROĽ S., MIHÓK P.: Note on a class of Hamiltonian polytopes. Discrete Math. 71 (1988), 233-241. | MR

[9] OWENS P. J.: Simple 3-polytopial graphs with edges of only two types and shortness coefficients. Discrete Math. 59 (1986), 107-114. | MR

[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. | MR | Zbl

[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. | MR