Name
Abstract | ||
|---|---|---|
It is welt-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. (C) 1997 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
1997 | 3.0.CO;2-J" target="_self" class="small-link-text"10.1002/(SICI)1097-0118(199705)25:13.0.CO;2-J | Journal of Graph Theory |
Field | DocType | Volume |
Discrete mathematics,Block graph,Indifference graph,Combinatorics,Line graph,Forbidden graph characterization,Chordal graph,Graph product,Symmetric graph,Pathwidth,Mathematics | Journal | 25 |
Issue | ISSN | Citations |
1 | 0364-9024 | 4 |
PageRank | References | Authors |
0.66 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Menke | 1 | 4 | 0.66 |
| Tudor Zamfirescu | 2 | 77 | 16.85 |
| Christina Zamfirescu | 3 | 4 | 0.66 |