Geodesic
Longest circuits in triangular and quadrangular $3$-polytopes with two types of edges
Mathematica slovaca, Tome 40 (1990) no. 4, pp. 341-357
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C40, 05C45 
@article{MASLO_1990_40_4_a1,
     author = {Jendro\v{l}, Stanislav and Keke\v{n}\'ak, Roman},
     title = {Longest circuits in triangular and quadrangular $3$-polytopes with two types of edges},
     journal = {Mathematica slovaca},
     pages = {341--357},
     year = {1990},
     volume = {40},
     number = {4},
     mrnumber = {1120965},
     zbl = {0757.05073},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1990_40_4_a1/}
}
TY  - JOUR
AU  - Jendroľ, Stanislav
AU  - Kekeňák, Roman
TI  - Longest circuits in triangular and quadrangular $3$-polytopes with two types of edges
JO  - Mathematica slovaca
PY  - 1990
SP  - 341
EP  - 357
VL  - 40
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_1990_40_4_a1/
LA  - en
ID  - MASLO_1990_40_4_a1
ER  - 
%0 Journal Article
%A Jendroľ, Stanislav
%A Kekeňák, Roman
%T Longest circuits in triangular and quadrangular $3$-polytopes with two types of edges
%J Mathematica slovaca
%D 1990
%P 341-357
%V 40
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_1990_40_4_a1/
%G en
%F MASLO_1990_40_4_a1
Jendroľ, Stanislav; Kekeňák, Roman. Longest circuits in triangular and quadrangular $3$-polytopes with two types of edges. Mathematica slovaca, Tome 40 (1990) no. 4, pp. 341-357. http://geodesic.mathdoc.fr/item/MASLO_1990_40_4_a1/

[1] EWALD G.: Hamiltonian circuits in simplicial complexes. Geometriae Dedicata 2, 1973, 115-125. | MR | Zbl

[2] EWALD G.: On shortness exponents of families of graphs. Israel J. Math., 16, 1973, 53-61. | MR | Zbl

[3] EWALD G., KLEINSCHMIDT P., PACHNER U., SCHULZ, CH.: Neuere Entwick- lungen in der kombinatorischen Konvexgeometrie. Contributions to geometry (ed. J. Tolke, J. M. Wills), Birkhäuser Verlag, Basel 1979, 131-169. | MR

[4] GRÜNBAUM B.: Convex polytopes. Wiley, New York 1967. | MR | Zbl

[5] GRÜNBAUM B.: Polytopes, graphs, and complexes. Bull. Amer. Math. Soc. 76, 1970, 1131-1201. | MR | Zbl

[6] GRÜNBAUM B., MALKEVITCH J.: Pairs of edge-disjoint Hamiltonian circuits. Aequatines Math. 14, 1976, 191 - 196. | MR | Zbl

[7] GRÜNBAUM B., WALTHER H.: Shortness exponents of families of graphs. J. Combinatorial Theory (A) 14, 1973, 364-385. | MR | Zbl

[8] HARANT J., WALTHER H.: Some new results about the shortness exponent in polyhedra graphs. Čas. pěst. mat., 112, 1987, 114-122. | MR

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

[10] JENDROĽ S., JUCOVIČ E.: On quadrangular convex 3-polytopes with at most two types of edges. Discrete Math. 78, 1989, 297-305. | MR | Zbl

[11] JENDROĽ S., JUCOVIČ E., TRENKLER M.: Vertex-vectors of quadrangular 3-polytopes with two types of edges. Combinatories and Graph Theory, Banach Center Publications, Vol. 25, PWN - Polish Scientific Publishers, Warsaw 1989, 93-111. | MR | Zbl

[12] JENDROĽ S., MIHÓK P.: On a class of Hamiltonian polytopes. Discrete Math. 71, 1988, 233-241. | MR | Zbl

[13] JENDROĽ S., TKÁČ M.: On the simplicial 3-polytopes with only two types of edges. Discrete Math. 48, 1984, 229-241. | MR | Zbl

[14] JUCOVIČ E.: Konvexné mnohosteny. Veda, Bratislava, 1981 (in Slovak).

[15] ORE O.: The four-color problem. Academic Press, New York-London, 1967. | MR | Zbl

[16] OWENS P. J.: Shortness parameters of families of regular planar graphs with two or three types of faces. Discrete Math. 39, 1982, 199-201. | MR

[17] OWENS P. J.: Regular planar graphs with faces of only two types and shortness parameters. J. Graph Theory 8, 1984, 253-275. | MR | Zbl

[18] OWENS P. J.: Non-hamiltonian simple 3-polytopes with only one type of face besides triangles. Annals of Discrete Math. 20, 1984, 241-251. | MR | Zbl

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

[20] PAREEK C. M.: On the maximum degree of locally hamiltonian non-hamiltonian graphs. Utilitas Mathematica 23, 1983, 101-120. | MR | Zbl

[21] TRENKLER M.: On the face-vector of a 5-valent convex 3-polytope. Mat. Časopis 25, 1975, 351-360. | MR | Zbl

[22] ZAKS J.: Shortness coeffìcient of cyclically 5-connected cubic planar graphs. Aequationes Math. 25, 1982, 97-102. | MR | Zbl