We give conditions on the minimum number k of colors, sufficient for the existence of given types of properly edge-colored subgraphs in a k-edge-colored complete graph. The types of subgraphs we study include families of internally pairwise vertex-disjoint paths with common endpoints, hamiltonian paths and hamiltonian cycles, cycles with a given lower bound of their length, spanning trees, stars, and cliques. Throughout the paper, related conjectures are proposed.
|Number of pages||16|
|Journal||Graphs and Combinatorics|
|Publication status||Published - jan. 1 1996|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics