Intersections of Longest Cycles in Grid Graphs

Journal of Graph Theory

Volumn 25, Issue 1, 1997, Pages 37-52

  Menke, B ^b   Zamfirescu, T ^b   Zamfirescu, C ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031528346     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199705)25:1<37::AID-JGT2>3.0.CO;2-J     Document Type: Article

References (12)

1. P. Erdös and G. Katona (eds.), Theory of Graphs, Proc. Colloq. Tihany, Hungary, Sept. 1966, Academic Press, New York (1968).
2. B. Grünbaum, Vertices missed by longest paths or circuits, J. Comb. Theory, A 17 (1974), 31-38.
3. W. Hatzel, Ein planarer hypohamiltonscher Graph mit 57 Knoten, Math. Ann. 243 (1979), 213-216.
4. B. Menke, Longest cycles in grid graphs, Periodica Math. Hung., to appear.
5. W. Schmitz, Über längste Wege und Kreise in Graphen, Rend. Sem. Mat. Univ. Padova 53 (1975), 97-103.
6. W. T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956), 99-116.
7. H.-J. Voss, Cycles and bridges in graphs, Kluwer Academic Publishers, Dordrecht (1991).
8. H. Walther, Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen, J. Comb. Theory 6 (1969), 1-6.
9. T. Zamfirescu, A two-connected planar graph without concurrent longest paths, J. Comb. Theory, B 13 (1972), 116-121.
10. T. Zamfirescu, On longest paths and circuits in graphs, Math. Scand. 38 (1976), 211-239.
11. T. Zamfirescu, Graphen, in welchen je zwei Eckpunkte durch einen längsten Weg vermieden werden, Rend. Sem. Mut. Univ. Ferrara 21 (1975), 17-24
12. k, Cahiers CERO 17 (1975), 427-439.