Minimal colorings for properly colored subgraphs

Y. Manoussakis, M. Spyratos, Z. Tuza, M. Voigt

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)345-360
Number of pages16
JournalGraphs and Combinatorics
Volume12
Issue number1
Publication statusPublished - 1996

Fingerprint

Hamiltonians
Coloring
Colouring
Subgraph
Edge-colored Graph
Hamiltonian path
Disjoint Paths
Hamiltonian circuit
Spanning tree
Clique
Complete Graph
Stars
Pairwise
Star
Sufficient
Lower bound
Color
Cycle
Vertex of a graph
Family

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

Manoussakis, Y., Spyratos, M., Tuza, Z., & Voigt, M. (1996). Minimal colorings for properly colored subgraphs. Graphs and Combinatorics, 12(1), 345-360.

Minimal colorings for properly colored subgraphs. / Manoussakis, Y.; Spyratos, M.; Tuza, Z.; Voigt, M.

In: Graphs and Combinatorics, Vol. 12, No. 1, 1996, p. 345-360.

Research output: Contribution to journalArticle

Manoussakis, Y, Spyratos, M, Tuza, Z & Voigt, M 1996, 'Minimal colorings for properly colored subgraphs', Graphs and Combinatorics, vol. 12, no. 1, pp. 345-360.
Manoussakis Y, Spyratos M, Tuza Z, Voigt M. Minimal colorings for properly colored subgraphs. Graphs and Combinatorics. 1996;12(1):345-360.
Manoussakis, Y. ; Spyratos, M. ; Tuza, Z. ; Voigt, M. / Minimal colorings for properly colored subgraphs. In: Graphs and Combinatorics. 1996 ; Vol. 12, No. 1. pp. 345-360.
@article{318ca973ab2246188f1bae53538ff960,
title = "Minimal colorings for properly colored subgraphs",
abstract = "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.",
author = "Y. Manoussakis and M. Spyratos and Z. Tuza and M. Voigt",
year = "1996",
language = "English",
volume = "12",
pages = "345--360",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "1",

}

TY - JOUR

T1 - Minimal colorings for properly colored subgraphs

AU - Manoussakis, Y.

AU - Spyratos, M.

AU - Tuza, Z.

AU - Voigt, M.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0000491546&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000491546&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0000491546

VL - 12

SP - 345

EP - 360

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -