Add to ORKGWe propose the notion of a majority $k$-edge-coloring of a graph $G$, which is an edge-coloring of $G$ with $k$ colors such that, for every vertex $u$ of $G$, at most half the edges of $G$ incident with $u$ have the same color. We show the best possible results that every graph of minimum degree at least $2$ has a majority $4$-edge-coloring, and that every graph of minimum degree at least $4$ has a majority $3$-edge-coloring. Furthermore, we discuss a natural variation of majority edge-colorings and some related open problems
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
Let $D$ be a finite or infinite digraph. A \emph{majority coloring} of $D$ is a vertex coloring such...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same colo...
We prove that every digraph has a vertex 4-colouring such that for each vertex v, at most half the o...
For graph G of order n a maximal edge-coloring is a proper partial coloring with fixed number of col...
A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vert...
AbstractThe following results and some generalizations are obtained. Consider all colorings of the n...
We explore four kinds of edge colorings defined by the requirement of equal number of colors appeari...
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in vario...
Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that...
A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. T...
A comprehensive treatment of color-induced graph colorings is presented in this book, emphasizing ve...
AbstractWe prove that the number of colors required to properly color the edges of a graph of order ...
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vert...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
Let $D$ be a finite or infinite digraph. A \emph{majority coloring} of $D$ is a vertex coloring such...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same colo...
We prove that every digraph has a vertex 4-colouring such that for each vertex v, at most half the o...
For graph G of order n a maximal edge-coloring is a proper partial coloring with fixed number of col...
A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vert...
AbstractThe following results and some generalizations are obtained. Consider all colorings of the n...
We explore four kinds of edge colorings defined by the requirement of equal number of colors appeari...
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in vario...
Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that...
A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. T...
A comprehensive treatment of color-induced graph colorings is presented in this book, emphasizing ve...
AbstractWe prove that the number of colors required to properly color the edges of a graph of order ...
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vert...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
Let $D$ be a finite or infinite digraph. A \emph{majority coloring} of $D$ is a vertex coloring such...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...