JOURNAL ARTICLE

Properly Coloured Hamiltonian Paths in Edge-Coloured Complete Graphs without Monochromatic Triangles.

Olof Barr

Year: 1998 Journal:   Ars Combinatoria Vol: 50 (5)Pages: 294-295   Publisher: Charles Babbage Research Centre
Keywords:
Monochromatic color Mathematics Enhanced Data Rates for GSM Evolution Combinatorics Hamiltonian (control theory) Hamiltonian path Graph Mathematical optimization Computer science Optics Physics Artificial intelligence

Metrics

13
Cited By
0.47
FWCI (Field Weighted Citation Impact)
0
Refs
0.54
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 theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Limits and Structures in Graph Theory
Physical Sciences →  Mathematics →  Discrete Mathematics and Combinatorics

Related Documents

JOURNAL ARTICLE

Properly coloured Hamiltonian paths in edge-coloured complete graphs

Jørgen Bang‐JensenGregory GutinAnders Yeo

Journal:   Discrete Applied Mathematics Year: 1998 Vol: 82 (1-3)Pages: 247-250
JOURNAL ARTICLE

Properly coloured Hamiltonian cycles in edge-coloured complete graphs

Allan Lo

Journal:   COMBINATORICA Year: 2015 Vol: 36 (4)Pages: 471-492
JOURNAL ARTICLE

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

Alexey Pokrovskiy

Journal:   Journal of Combinatorial Theory Series B Year: 2014 Vol: 106 Pages: 70-97
JOURNAL ARTICLE

Monochromatic triangles in three-coloured graphs

James CummingsDaniel Král͏̌Florian PfenderKonrad SperfeldAndrew TreglownMichael E. Young

Journal:   Journal of Combinatorial Theory Series B Year: 2013 Vol: 103 (4)Pages: 489-503
JOURNAL ARTICLE

Long properly coloured cycles in edge‐coloured graphs

Allan Lo

Journal:   Journal of Graph Theory Year: 2018 Vol: 90 (3)Pages: 416-442
© 2026 ScienceGate Book Chapters — All rights reserved.