相关论文: Bounded Max-Colorings of Graphs

Let $H$ be a triple system with maximum degree $d>1$ and let $r>10^7\sqrt{d}\log^{2}d$. Then $H$ has a proper vertex coloring with $r$ colors such that any two color classes differ in size by at most one. The bound on $r$ is sharp in order…

For an integer $r>0$, a conditional $(k,r)$-coloring of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex $v$ of degree $d(v)$ in $G$ is adjacent to vertices with at least $min\{r, d(v)\}$ different colors.…

A coloring of the edges of a graph $G$ in which every $K_{1,2}$ is totally multicolored is known as a proper coloring and a coloring of the edges of $G$ in which every $K_{1,2}$ and every $K_{2,2}$ is totally multicolored is called a…

A '(partial) conflict-free coloring' of a hypergraph $\mathcal{H}$ is an assignment of colors to (a subset of) the vertex set of $\mathcal{H}$ such that every hyperedge in $\mathcal{H}$ has a vertex whose color is distinct from every other…

In 1985, Erd\H{o}s and Ne\'{s}etril conjectured that the strong edge-coloring number of a graph is bounded above by ${5/4}\Delta^2$ when $\Delta$ is even and ${1/4}(5\Delta^2-2\Delta+1)$ when $\Delta$ is odd. They gave a simple construction…

A weighted coloured-edge graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such…

A $b$-coloring of a graph is a proper coloring such that every color class contains a vertex adjacent to at least one vertex in each of the other color classes. The $b$-chromatic number of a graph $G$, denoted by $b(G)$, is the maximum…

A square coloring of a graph $G$ is a coloring of the square $G^2$ of $G$, that is, a coloring of the vertices of $G$ such that any two vertices that are at distance at most $2$ in $G$ receive different colors. We investigate the complexity…

Let $H$ be a fixed graph. Denote $f(n,H)$ to be the maximum number of edges not contained in any monochromatic copy of $H$ in a 2-edge-coloring of the complete graph $K_n$, and $ex(n,H)$ to be the {\it Tur\'an number} of $H$. An easy lower…

A tree-coloring of a maximal planar graph is a proper vertex $4$-coloring such that every bichromatic subgraph, induced by this coloring, is a tree. A maximal planar graph $G$ is tree-colorable if $G$ has a tree-coloring. In this article,…

The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of…

A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…

We introduce a variant of the graph coloring problem, which we denote as {\sc Budgeted Coloring Problem} (\bcp). Given a graph $G$, an integer $c$ and an ordered list of integers $\{b_1, b_2, \ldots, b_c\}$, \bcp asks whether there exists a…

NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a…

The $k$-Colouring problem is to decide if the vertices of a graph can be coloured with at most $k$ colours for a fixed integer $k$ such that no two adjacent vertices are coloured alike. If each vertex u must be assigned a colour from a…

We investigate a number of coloring problems restricted to bipartite graphs with bounded diameter. First, we investigate the $k$-List Coloring, List $k$-Coloring, and $k$-Precoloring Extension problems on bipartite graphs with diameter at…

In the Matching Cut problem we ask whether a graph $G$ has a matching cut, that is, a matching which is also an edge cut of $G$. We consider the variants Perfect Matching Cut and Disconnected Perfect Matching where we ask whether there…

For positive integers $n$ and $r$, we consider $n$-vertex graphs with the maximum number of $r$-edge-colorings with no copy of a triangle where exactly two colors appear. We prove that, if $2 \leq r \leq 26$ and $n$ is sufficiently large,…

Restricted star colouring is a variant of star colouring introduced to design heuristic algorithms to estimate sparse Hessian matrices. For $k\in\mathbb{N}$, a $k$-restricted star colouring ($k$-rs colouring) of a graph $G$ is a function…

We show that the edges of any graph $G$ containing two edge-disjoint spanning trees can be blue/red coloured so that the blue and red graphs are connected and the blue and red degrees at each vertex differ by at most four. This improves a…