Rainbow Subgraphs in Edge-Colorings of Complete Graphs

P. Erdös; Źsolt Tuza

doi:10.1016/s0167-5060(08)70377-7

ScienceGate Book Chapters

BOOK-CHAPTER

Rainbow Subgraphs in Edge-Colorings of Complete Graphs

P. Erdös Źsolt Tuza

Year: 1993 Annals of discrete mathematics Pages: 81-88 Publisher: Elsevier BV

DOI: 10.1016/s0167-5060(08)70377-7

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Rainbow Edge coloring Vertex (graph theory) Graph Greedy coloring Complete coloring Discrete mathematics Line graph Graph power Physics

Metrics

Cited By

1.45

FWCI (Field Weighted Citation Impact)

Refs

0.68

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Rainbow Subgraphs in Edge-Colorings of Complete Graphs

Metrics

Citation History

Topics

Related Documents

Polychromatic edge-colorings of subgraphs of balanced complete bipartite graphs

Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles

Edge-colorings avoiding rainbow and monochromatic subgraphs

Graphs with many edge-colorings such that complete graphs are rainbow

Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs