Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs

Herbert Fleischner; Arthur M. Hobbs

doi:10.4153/cmb-1976-025-3

ScienceGate Book Chapters

JOURNAL ARTICLE

Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs

Herbert Fleischner Arthur M. Hobbs

Year: 1976 Journal: Canadian Mathematical Bulletin Vol: 19 (2)Pages: 169-172 Publisher: Cambridge University Press

DOI: 10.4153/cmb-1976-025-3

Get Full-Text PDF Get Analytical Report

Abstract

In this paper we determine necessary and sufficient conditions for the square of a vertex-unicyclic graph to be Hamiltonian. The conditions are simple and easily checked. Further, we show that the square of a vertex-unicyclic graph is Hamiltonian if and only if it is vertex-pancyclic.

Keywords:

Mathematics Combinatorics Vertex (graph theory) Hamiltonian path Graph Hamiltonian (control theory) Hamiltonian path problem Discrete mathematics Mathematical optimization

Metrics

Cited By

0.60

FWCI (Field Weighted Citation Impact)

Refs

0.72

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs

Abstract

Metrics

Topics

Related Documents

Maximal Hamiltonian cycles in squares of graphs

Hamiltonian cycles in vertex symmetric graphs of order 2P2

On super vertex-graceful unicyclic graphs

Trees and unicyclic graphs with hamiltonian path graphs

Counting Hamiltonian Cycles on Quartic 4-Vertex-Connected Planar Graphs