JOURNAL ARTICLE

Long cycles in graphs without hamiltonian paths

Ken‐ichi KawarabayashiKenta OzekiTomoki Yamashita

Year: 2007 Journal:   Discrete Mathematics Vol: 308 (24)Pages: 5899-5906   Publisher: Elsevier BV
Keywords:
Combinatorics Mathematics Hamiltonian path Discrete mathematics Graph

Metrics

5
Cited By
1.36
FWCI (Field Weighted Citation Impact)
9
Refs
0.78
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Graph Labeling and Dimension Problems
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Polyhedral graphs without hamiltonian cycles

Hansjoachim Walther

Journal:   Discrete Applied Mathematics Year: 1997 Vol: 79 (1-3)Pages: 257-263
JOURNAL ARTICLE

Coloring graphs without short cycles and long induced paths

Petr A. GolovachDaniël PaulusmaJian Song

Journal:   Discrete Applied Mathematics Year: 2014 Vol: 167 Pages: 107-120
BOOK-CHAPTER

Coloring Graphs without Short Cycles and Long Induced Paths

Petr A. GolovachDaniël PaulusmaJian Song

Lecture notes in computer science Year: 2011 Pages: 193-204
© 2026 ScienceGate Book Chapters — All rights reserved.