相关论文: Coloring ($P_5$, kite)-free graphs

A total coloring of a graph $G$ is a coloring of the vertices and edges such that two adjacent or incident elements receive different colors. The minimum number of colors required for a total coloring of a graph $G$ is called the total…

For graphs $G$ and $H$, an $H$-coloring of $G$ is an edge-preserving mapping from $V(G)$ to $V(H)$. Note that if $H$ is the triangle, then $H$-colorings are equivalent to $3$-colorings. In this paper we are interested in the case that $H$…

We show that determining the chromatic number of a $\{P_5,\bar{P_5}\}$-free graph or a $\{P_5,K_p-e\}$-free graph can be done in polynomial time

In this paper, we establish an optimal $\chi$-binding function for $(P_2\cup P_4,\text{ diamond})$-free graphs. We prove that for any graph $G$ in this class, $\chi(G)\le 4$ when $\omega(G)=2$, $\chi(G)\le 6$ when $\omega(G)=3$, and…

The coloring problem is a well-research topic and its complexity is known for several classes of graphs. However, the question of its complexity remains open for the class of antiprismatic graphs, which are the complement of prismatic…

Given a graph $H$ and a positive integer $k$, the {\it $k$-colored Ramsey number} $R_k(H)$ is the minimum integer $n$ such that in every $k$-edge-coloring of the complete graph $K_{n}$, there is a monochromatic copy of $H$. Given two graphs…

A graph is $k$-vertex-critical if $\chi(G)=k$ but $\chi(G-v)<k$ for all $v\in V(G)$. We construct a new infinite families of $k$-vertex-critical $(P_5,C_5)$-free graphs for all $k\ge 6$. Our construction generalizes known constructions for…

A graph $G$ is called a complete $k$-partite ($k\geq 2$) graph if its vertices can be partitioned into $k$ independent sets $V_{1},...,V_{k}$ such that each vertex in $V_{i}$ is adjacent to all the other vertices in $V_{j}$ for $1\leq…

It has been conjectured that for every claw-free graph $G$ the choice number of $G$ is equal to its chromatic number. We focus on the special case of this conjecture where $G$ is perfect. Claw-free perfect graphs can be decomposed via…

An edge-colored graph $G$ is $k$-color connected if, between each pair of vertices, there exists a path using at least $k$ different colors. The $k$-color connection number of $G$, denoted by $cc_{k}(G)$, is the minimum number of colors…

A strong edge coloring of a graph $G$ is an edge coloring $\phi\,:\,E(G) \rightarrow \mathbb N$ such that each color class forms an induced matching in $G$. The strong chromatic index of $G$, written $\chi'_s(G)$, is the minimum number of…

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…

For a graph $G$, let $\chi(G)$ ($\omega(G)$) denote its chromatic (clique) number. A $P_2+P_3$ is the graph obtained by taking the disjoint union of a two-vertex path $P_2$ and a three-vertex path $P_3$. A $\bar{P_2+P_3}$ is the complement…

We describe an algorithm for generating all $k$-critical $\mathcal H$-free graphs, based on a method of Ho\`{a}ng et al. Using this algorithm, we prove that there are only finitely many $4$-critical $(P_7,C_k)$-free graphs, for both $k=4$…

The reconfiguration graph of the $k$-colorings of a graph $G$, denoted $R_{k}(G)$, is the graph whose vertices are the $k$-colorings of $G$ and two colorings are adjacent in $R_{k}(G)$ if they differ in color on exactly one vertex. A graph…

An open packing in a graph $G$ is a set $S$ of vertices in $G$ such that no two vertices in $S$ have a common neighbor in $G$. The injective chromatic number $\chi_i(G)$ of $G$ is the smallest number of colors assigned to vertices of $G$…

A total $k$-coloring of a graph is an assignment of $k$ colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The Total Coloring Conjecture (TCC) states that every simple graph $G$ has a…

The chromatic number $\chi$ of a graph is bounded from below by its clique number $\omega,$ but it can be arbitrary large. Perfect graphs are defined by $\chi=\omega$ for all induced subgraphs. An interesting relaxation are $\chi$-bounded…

A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to…

The reconfiguration graph for the $k$-colourings of a graph $G$, denoted $R_{k}(G)$, is the graph whose vertices are the $k$-colourings of $G$ and two colourings are joined by an edge if they differ in colour on exactly one vertex. For any…