Premium
Chords of longest circuits of graphs embedded in torus and Klein bottle
Author(s) -
Li Xuechao,
Zhang CunQuan
Publication year - 2003
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10091
Subject(s) - klein bottle , torus , combinatorics , mathematics , chord (peer to peer) , graph , discrete mathematics , polyomino , computer science , geometry , distributed computing , regular polygon
Thomassen conjectured that every longest circuit of a 3‐connected graph has a chord. It is proved in this paper that every longest circuit of a 4‐connected graph embedded in a torus or Klein bottle has a chord. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 1–23, 2003
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom