Related papers: Packing coloring of graphs with long paths
We study a new variant of \emph{connected coloring} of graphs based on the concept of \emph{strong} edge coloring (every color class forms an \emph{induced} matching). In particular, an edge-colored path is \emph{strongly proper} if its…
We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any…
The "clustered chromatic number" of a class of graphs is the minimum integer $k$ such that for some integer $c$ every graph in the class is $k$-colourable with monochromatic components of size at most $c$. We determine the clustered…
Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology \cite{Civan}, and the framework through which it was studied, we introduce the linear coloring on graphs. We…
A hamiltonian coloring $c$ of a graph $G$ of order $n$ is a mapping $c$ : $V(G) \rightarrow \{0,1,2,...\}$ such that $D(u, v)$ + $|c(u) - c(v)|$ $\geq$ $n-1$, for every two distinct vertices $u$ and $v$ of $G$, where $D(u, v)$ denotes the…
Recently, Borodin, Kostochka, and Yancey (On $1$-improper $2$-coloring of sparse graphs. Discrete Mathematics, 313(22), 2013) showed that the vertices of each planar graph of girth at least $7$ can be $2$-colored so that each color class…
The locating chromatic number of a graph is the smallest integer $n$ such that there is a proper $n$-coloring $c$ and every vertex has a unique vector of distances to colors in $c$. We explore the necessary conditions and provide sufficient…
A star edge-coloring of a graph $G$ is a proper edge-coloring without bichromatic paths or cycles of length four. The smallest integer $k$ such that $G$ admits a star edge-coloring with $k$ colors is the star chromatic index of $G$. In the…
We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the…
An edge-locating coloring of a simple connected graph $G$ is a partition of its edge set into matchings such that the vertices of $G$ are distinguished by the distance to the matchings. The minimum number of the matchings of $G$ that admits…
Given a sequence \( S = (s_1, s_2, \ldots, s_k) \) of positive integers satisfying \( s_1 \leq s_2 \leq \dots \leq s_k \), an \( S \)-packing coloring of a graph \( G \) is a partition of \( V(G) \) into \( k \) subsets \( V_1, V_2, \dots,…
A \emph{star coloring} of a graph $G$ is a proper vertex-coloring such that no path on four vertices is $2$-colored. The minimum number of colors required to obtain a star coloring of a graph $G$ is called star chromatic number and it is…
A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that no path or cycle of length four is bi-colored. The star chromatic index of $G$, denoted by $\chi^{\prime}_{s}(G)$, is the minimum $k$ such that $G$ admits a star…
For a non-decreasing sequence $S=(s_1,s_2,\ldots)$ of positive integers, a partition of the vertex set of a graph $G$ into subsets $X_1,\ldots, X_\ell$, such that vertices in $X_i$ are pairwise at distance greater than $s_i$ for every…
A star coloring of a graph $G$ is a proper vertex coloring such that the subgraph induced by any pair of color classes is a star forest. The star chromatic number of $G$ is the minimum number of colors needed to star color $G$. In this…
Let $G$ be the unit distance graph in the plane. A well-known problem in combinatorial geometry is that of determining the chromatic number of $G$. It is known that $4\le \chi(G)\le 7$. The upper bound of 7 is obtained using tilings of the…
In this paper, we present a foundation study for proper colouring of edge-set graphs. The authors consider that a detailed study of the colouring of edge-set graphs corresponding to the family of paths is best suitable for such foundation…
We denote by $\chi$ g (G) the game chromatic number of a graph G, which is the smallest number of colors Alice needs to win the coloring game on G. We know from Montassier et al. [M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu,…
We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each $G_i$…
The clustered chromatic number of a graph class is the minimum integer $t$ such that for some $C$ the vertices of every graph in the class can be colored in $t$ colors so that every monochromatic component has size at most $C$. We show that…