An Counterexample to the Proposition about Special Generating Subgraph of Hamiltonian Graph |
Received:September 28, 1991 |
Key Words:
|
Fund Project: |
|
Hits: 1897 |
Download times: 1192 |
Abstract: |
Theorem 3 in [l] states that any Hamiltonian graph must contain an alternate even-cycle connecting p subcycles with p bridges (p ≥ 2), here the p subcycles are elementary and disconnected one another. In this paper we give a counterexample to this proposition. In addition, we substitute some conclusions for it. |
Citation: |
DOI:10.3770/j.issn:1000-341X.1993.04.021 |
View Full Text View/Add Comment |