Premium
Intersections of longest cycles in grid graphs
Author(s) -
Menke B.,
Zamfirescu T.,
Zamfirescu C.
Publication year - 1997
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199705)25:1<37::aid-jgt2>3.0.co;2-j
Subject(s) - combinatorics , mathematics , split graph , block graph , discrete mathematics , graph , chordal graph , indifference graph , 1 planar graph
It is well‐known that the largest cycles of a graph may have empty intersection. This is the case, for example, for any hypohamiltonian graph. In the literature, several important classes of graphs have been shown to contain examples with the above property. This paper investigates a (nontrivial) class of graphs which, on the contrary, admits no such example. © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 37–52, 1997