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

Olof Barr

JOURNAL ARTICLE

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

Year: 1998 Journal: Ars Combinatoria Vol: 50 (5)Pages: 294-295 Publisher: Charles Babbage Research Centre

Get Full-Text PDF Get Analytical Report

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

Cited By

0.47

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Citation History

Topics

Related Documents

Properly coloured Hamiltonian paths in edge-coloured complete graphs

Properly coloured Hamiltonian cycles in edge-coloured complete graphs

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

Monochromatic triangles in three-coloured graphs

Long properly coloured cycles in edge‐coloured graphs