There are a number of well‐known problems and conjectures about partitioning graphs to
satisfy local constraints. For example, the majority colouring conjecture of Kreutzer, Oum …

A tantalizing open problem, posed independently by Stiebitz in 1995 and by Alon in 2006,
asks whether for every pair of integers $ s, t\ge 1$ there exists a finite number $ F (s, t) …

We investigate possible list extensions of generalised majority edge colourings of graphs
and provide several results concerning these. Given a graph $ G=(V, E) $, a list assignment …

A majority coloring of a directed graph is a vertex coloring in which each vertex has the
same color as at most half of its out-neighbors. In this note we simplify some proof …

Majority Coloring of r-Regular Digraph Email Alert | Rss | Fig/Tab Home About Journal
Editorial Board Instruction Journal Online Current Issue Just Accepted Most Read Articles …

In any vertex coloring of a graph some edges have differently colored ends (bichromatic
edges) and some are monochromatic. In a proper coloring all edges are bichromatic. In a …

A $\frac {1}{k} $-majority $ l $-edge-colouring of a graph $ G $ is a colouring of its edges with
$ l $ colours such that for every colour $ i $ and each vertex $ v $ of $ G $, at most $\frac …

Diese Dissertation beschäftigt sich mit Problemstellungen aus der Theorie der endlichen
gerichteten Graphen. Ein (endlicher) gerichteter Graph ist eine binäre Relation, deren …

A majority coloring of a digraph D with k colors is an assignment π: V (D)→{1, 2,…, k} such
that for every v∈ V (D) we have π (w)= π (v) for at most half of all out-neighbors w∈ N+(v). A …

A majority coloring of a digraph is a function that assigns each vertex a color so that at most
half of each vertex has the same color as its out-neighbors. Kreutzer, Oum, Seymour, van …