Non‐Hamiltonian Cartesian products of two even dicycles

Abstract In this note it is proven that there exist infinitely many positive integers and such that the Cartesian product of a directed cycle of length and a directed cycle of length is non‐Hamiltonian. In particular, the Cartesian product of an 880‐dicycle and a 4368‐dicycle is non‐Hamiltonian. We also prove that there is no such graph on fewer than vertices, which is rather astonishing.

Authors

Institutions

Publication Details

Journal
Journal of Graph Theory
Published
2024-09-30
DOI
https://doi.org/10.1002/jgt.23185
Primary Topic
Synthesis and Properties of Aromatic Compounds
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Non‐Hamiltonian Cartesian products of two even dicycles

Kenta Noguchi, Carol T. Zamfirescu
Journal of Graph Theory
Synthesis and Properties of Aromatic Compounds
article

Non‐Hamiltonian Cartesian products of two even dicycles

Kenta Noguchi, Carol T. Zamfirescu
article en

Abstract

Abstract In this note it is proven that there exist infinitely many positive integers and such that the Cartesian product of a directed cycle of length and a directed cycle of length is non‐Hamiltonian. In particular, the Cartesian product of an 880‐dicycle and a 4368‐dicycle is non‐Hamiltonian. We also prove that there is no such graph on fewer than vertices, which is rather astonishing.

Journal of Graph TheoryVol. 108(2)
Tokyo University of Science (JP), Babeș-Bolyai University (RO), Ghent University (BE)
Japan Society for the Promotion of Science
Openalex Percentile: Top 88%
Synthesis and Properties of Aromatic Compounds
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.