Related papers: The oriented relative clique number of triangle-fr…
The clique number of an undirected graph $G$ is the maximum order of a complete subgraph of $G$ and is a well-known lower bound for the chromatic number of $G$. Every proper $k$-coloring of $G$ may be viewed as a homomorphism (an…
Duffy et al. [C. Duffy, G. MacGillivray, and \'E. Sopena, Oriented colourings of graphs with maximum degree three and four, Discrete Mathematics, 342(4), p. 959--974, 2019] recently considered the oriented chromatic number of connected…
An $(n,m)$-graph is a graph with $n$ types of arcs and $m$ types of edges. A homomorphism of an $(n,m)$-graph $G$ to another $(n,m)$-graph $H$ is a vertex mapping that preserves the adjacencies along with their types and directions. The…
A clique colouring of a graph is a colouring of the vertices such that no maximal clique is monochromatic (ignoring isolated vertices). The least number of colours in such a colouring is the clique chromatic number. Given $n$ points $x_1,…
The clique chromatic number of a graph G=(V,E) is the minimum number of colors in a vertex coloring so that no maximal (with respect to containment) clique is monochromatic. We prove that the clique chromatic number of the binomial random…
Let $G$ be a graph with $n$ vertices, $m$ edges, average degree $\delta$, and maximum degree $\Delta$. The "oriented chromatic number" of $G$ is the maximum, taken over all orientations of $G$, of the minimum number of colours in a proper…
The proper chromatic number $\Vec{\chi}(G)$ of a graph $G$ is the minimum $k$ such that there exists an orientation of the edges of $G$ with all vertex-outdegrees at most $k$ and such that for any adjacent vertices, the outdegrees are…
We prove that every triangle-free graph with maximum degree $\Delta$ has list chromatic number at most $(1+o(1))\frac{\Delta}{\ln \Delta}$. This matches the best-known bound for graphs of girth at least 5. We also provide a new proof that…
An orientation of $G$ is a digraph obtained from $G$ by replacing each edge by exactly one of two possible arcs with the same endpoints. We call an orientation \emph{proper} if neighbouring vertices have different in-degrees. The proper…
Oriented chromatic number of an oriented graph $G$ is the minimum order of an oriented graph $H$ such that $G$ admits a homomorphism to $H$. The oriented chromatic number of an unoriented graph $G$ is the maximal chromatic number over all…
A strong edge-coloring of a graph $G$ is a coloring of edges of $G$ such that every color class forms an induced matching. The strong chromatic index is the minimum number of colors needed to color the graph. The Ore-degree $\theta(G)$ of a…
Let $G$ be a graph. We use $\chi(G)$ and $\omega(G)$ to denote the chromatic number and clique number of $G$ respectively. A $P_5$ is a path on 5 vertices, and an $HVN$ is a $K_4$ together with one more vertex which is adjacent to exactly…
A clique-coloring of a given graph $G$ is a coloring of the vertices of $G$ such that no maximal clique of size at least two is monocolored. The clique-chromatic number of $G$ is the least number of colors for which $G$ admits a…
A clique-coloring of a graph $G$ is a coloring of the vertices of $G$ so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $\mathcal{H}(G)$, of a graph $G$ has $V(G)$ as its set of vertices and the maximal…
The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In this paper, we determine the order of magnitude of the clique chromatic number of the random graph…
The oriented chromatic number of a directed graph $G$ is the minimum order of an oriented graph to which $G$ has a homomorphism. The oriented chromatic number $\chi_o({\cal F})$ of a graph family ${\cal F}$ is the maximum oriented chromatic…
We prove that the chromatic number of a circle graph with clique number $\omega$ is at most $7\omega^2$.
Here we prove that if G has independence no. 2 and clique size omega with omega less than or equal to 11, then (1) chromatic no. is less than or equal to (omega2+12omega-13)/8, if omega is odd, and (2) chromatic no. is less than or equal to…
In this paper, we are interested in some problems related to chromatic number and clique number for the class of $(P_5,K_5-e)$-free graphs, and prove the following. $(a)$ If $G$ is a connected ($P_5,K_5-e$)-free graph with $\omega(G)\geq…
Let $G$ be a graph. We use $\chi(G)$ and $\omega(G)$ to denote the chromatic number and clique number of $G$ respectively. A $P_5$ is a path on 5 vertices. A family of graphs $\mathcal{G}$ is said to be {\it$\chi$-bounded} if there exists…