Decompositions of Edge-Colored Complete Graphs

E. R. Lamken; Richard M. Wilson

doi:10.1006/jcta.1999.3005

ScienceGate Book Chapters

JOURNAL ARTICLE

Decompositions of Edge-Colored Complete Graphs

E. R. Lamken Richard M. Wilson

Year: 2000 Journal: Journal of Combinatorial Theory Series A Vol: 89 (2)Pages: 149-200 Publisher: Elsevier BV

DOI: 10.1006/jcta.1999.3005

Get Full-Text PDF Get Analytical Report

Keywords:

Colored Mathematics Mathematical proof Skew Combinatorics Enhanced Data Rates for GSM Evolution Discrete mathematics Group (periodic table) Class (philosophy) Grid Computer science Geometry

Metrics

Cited By

1.90

FWCI (Field Weighted Citation Impact)

Refs

0.87

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Coding theory and cryptography

Physical Sciences → Computer Science → Artificial Intelligence

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Decompositions of Edge-Colored Complete Graphs

Metrics

Citation History

Topics

Related Documents

More on decompositions of edge-colored complete graphs

Edge Decompositions of Colored Graphs

Decompositions of edge-colored infinite complete graphs into monochromatic paths

Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs

Complete edge-colored permutation graphs