Gallai colorings and domination in multipartite digraphs

A. Gyárfás, Gábor Simonyi, Ágnes Tóth

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Assume that D is a digraph without cyclic triangles and its vertices are partitioned into classes A 1, ..., A t of independent vertices. A set U = ∪ i∈S A i is called a dominating set of size |S| if for any vertex V ∈ ∪ i∉S A i there is a w ∈ U such that (w, v)∈E(D). Let β(D) be the cardinality of the largest independent set of D whose vertices are from different partite classes of D. Our main result says that there exists a h = h(β(D)) such that D has a dominating set of size at most h. This result is applied to settle a problem related to generalized Gallai colorings, edge colorings of graphs without 3-colored triangles.

Original languageEnglish
Pages (from-to)278-292
Number of pages15
JournalJournal of Graph Theory
Volume71
Issue number3
DOIs
Publication statusPublished - Nov 2012

Fingerprint

Dominating Set
Domination
Digraph
Cyclic triangles
Colouring
Edge Coloring
Independent Set
Large Set
Triangle
Cardinality
Graph in graph theory
Vertex of a graph
Class

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Gallai colorings and domination in multipartite digraphs. / Gyárfás, A.; Simonyi, Gábor; Tóth, Ágnes.

In: Journal of Graph Theory, Vol. 71, No. 3, 11.2012, p. 278-292.

Research output: Contribution to journalArticle

Gyárfás, A. ; Simonyi, Gábor ; Tóth, Ágnes. / Gallai colorings and domination in multipartite digraphs. In: Journal of Graph Theory. 2012 ; Vol. 71, No. 3. pp. 278-292.
@article{f057eac0764d42eaaf35a9de8aef5bc8,
title = "Gallai colorings and domination in multipartite digraphs",
abstract = "Assume that D is a digraph without cyclic triangles and its vertices are partitioned into classes A 1, ..., A t of independent vertices. A set U = ∪ i∈S A i is called a dominating set of size |S| if for any vertex V ∈ ∪ i∉S A i there is a w ∈ U such that (w, v)∈E(D). Let β(D) be the cardinality of the largest independent set of D whose vertices are from different partite classes of D. Our main result says that there exists a h = h(β(D)) such that D has a dominating set of size at most h. This result is applied to settle a problem related to generalized Gallai colorings, edge colorings of graphs without 3-colored triangles.",
author = "A. Gy{\'a}rf{\'a}s and G{\'a}bor Simonyi and {\'A}gnes T{\'o}th",
year = "2012",
month = "11",
doi = "10.1002/jgt.20646",
language = "English",
volume = "71",
pages = "278--292",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "3",

}

TY - JOUR

T1 - Gallai colorings and domination in multipartite digraphs

AU - Gyárfás, A.

AU - Simonyi, Gábor

AU - Tóth, Ágnes

PY - 2012/11

Y1 - 2012/11

N2 - Assume that D is a digraph without cyclic triangles and its vertices are partitioned into classes A 1, ..., A t of independent vertices. A set U = ∪ i∈S A i is called a dominating set of size |S| if for any vertex V ∈ ∪ i∉S A i there is a w ∈ U such that (w, v)∈E(D). Let β(D) be the cardinality of the largest independent set of D whose vertices are from different partite classes of D. Our main result says that there exists a h = h(β(D)) such that D has a dominating set of size at most h. This result is applied to settle a problem related to generalized Gallai colorings, edge colorings of graphs without 3-colored triangles.

AB - Assume that D is a digraph without cyclic triangles and its vertices are partitioned into classes A 1, ..., A t of independent vertices. A set U = ∪ i∈S A i is called a dominating set of size |S| if for any vertex V ∈ ∪ i∉S A i there is a w ∈ U such that (w, v)∈E(D). Let β(D) be the cardinality of the largest independent set of D whose vertices are from different partite classes of D. Our main result says that there exists a h = h(β(D)) such that D has a dominating set of size at most h. This result is applied to settle a problem related to generalized Gallai colorings, edge colorings of graphs without 3-colored triangles.

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

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

U2 - 10.1002/jgt.20646

DO - 10.1002/jgt.20646

M3 - Article

AN - SCOPUS:84865738581

VL - 71

SP - 278

EP - 292

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 3

ER -