Lattice graphs with non-concurrent longest cycles

Ali Dino Jumani; Carol T. Zamfirescu; Tudor I. Zamfirescu

doi:10.4171/RSMUP/132-6

Lattice graphs with non-concurrent longest cycles

Ali Dino Jumani, Carol T. Zamfirescu, Tudor I. Zamfirescu

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

No hypohamiltonian graphs are embeddable in the planar square lattice. This lattice contains, however, graphs in which every vertex is missed by some longest cycle. In this paper we present graphs with this property, embeddable in various lattices, and of remarkably small order.

Original language	English
Pages (from-to)	75-82
Number of pages	8
Journal	Rendiconti Del Seminario Matematico Della Universita Di Padova
Volume	132
DOIs	https://doi.org/10.4171/RSMUP/132-6
Publication status	Published - 2014
Externally published	Yes

Keywords

Lattice graphs
Longest cycles

Access to Document

10.4171/RSMUP/132-6

Cite this

@article{d36ff92ff7d74ddc86c2fd2d72f163b5,

title = "Lattice graphs with non-concurrent longest cycles",

abstract = "No hypohamiltonian graphs are embeddable in the planar square lattice. This lattice contains, however, graphs in which every vertex is missed by some longest cycle. In this paper we present graphs with this property, embeddable in various lattices, and of remarkably small order.",

keywords = "Lattice graphs, Longest cycles",

author = "Jumani, {Ali Dino} and Zamfirescu, {Carol T.} and Zamfirescu, {Tudor I.}",

year = "2014",

doi = "10.4171/RSMUP/132-6",

language = "English",

volume = "132",

pages = "75--82",

journal = "Rendiconti Del Seminario Matematico Della Universita Di Padova",

issn = "0041-8994",

publisher = "C E D A M Spa Casa Editr Dott Antonio Milani",

}

TY - JOUR

T1 - Lattice graphs with non-concurrent longest cycles

AU - Jumani, Ali Dino

AU - Zamfirescu, Carol T.

AU - Zamfirescu, Tudor I.

PY - 2014

Y1 - 2014

N2 - No hypohamiltonian graphs are embeddable in the planar square lattice. This lattice contains, however, graphs in which every vertex is missed by some longest cycle. In this paper we present graphs with this property, embeddable in various lattices, and of remarkably small order.

AB - No hypohamiltonian graphs are embeddable in the planar square lattice. This lattice contains, however, graphs in which every vertex is missed by some longest cycle. In this paper we present graphs with this property, embeddable in various lattices, and of remarkably small order.

KW - Lattice graphs

KW - Longest cycles

UR - https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=web_of_science_starterapi&SrcAuth=WosAPI&KeyUT=WOS:000348092800006&DestLinkType=FullRecord&DestApp=WOS_CPL

U2 - 10.4171/RSMUP/132-6

DO - 10.4171/RSMUP/132-6

M3 - Article

SN - 0041-8994

VL - 132

SP - 75

EP - 82

JO - Rendiconti Del Seminario Matematico Della Universita Di Padova

JF - Rendiconti Del Seminario Matematico Della Universita Di Padova

ER -

Lattice graphs with non-concurrent longest cycles

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this