The Square of Every 2-Connected Graph is 1-Hamiltonian,
Abstract
If G is a connected graph of order at least 4 and G contains no cut-vertices, then both G sup 2 and G sup 2 - v are hamiltonian graphs for each vertex v of G. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1971
- Accession Number
- AD0732459
Entities
People
- Gary Chartrand
- S. F. Kapoor
Organizations
- University of California, Santa Barbara