|
|
Publication
|
| Title of Article |
Flexible coloring of graphs |
| Date of Acceptance |
10 December 2015 |
| Journal |
| Title of Journal |
Far East Journal of Mathematical Sciences (FJMS) |
| Standard |
SCOPUS |
| Institute of Journal |
Pushpa Publishing House |
| ISBN/ISSN |
ISSN:0972-0871 |
| Volume |
99 |
| Issue |
6 |
| Month |
February |
| Year of Publication |
2016 |
| Page |
921-943 |
| Abstract |
\begin{abstract}{ Li et al. [2] introduced the definition of a flexible coloring in hypergraphs. A \emph{flexible coloring} of a hypergraph $H$ is an assignment of list of one or more colors to each vertex such that, for each edge, we can choose a color from the color list of each vertex so that an edge is strongly colored. In this paper, we present the study of flexible coloring in graphs. The smallest summation of sizes of color lists of all vertices from flexible coloring with $t$ allowable colors of $G$ is denoted by $F_t(G)$. We find $F_t(G)$, for all possible $t$, where $G$ is a path, a cycle, a tree, a wheel graph, a hypercube graph, a complete graph, or a complete $k$-partite graph.
Moreover, we find $F_t(G\times H)$ and $F_t(G\vee H)$, where $G\times H$ denotes the Cartesian product of $G$ and $H$, $G\vee H$ denotes the join of $G$ and $H$, and each graph is a path, a cycle, or a complete graph. }
\end{abstract} |
| Keyword |
flexible coloring, strong coloring |
| Author |
|
| Reviewing Status |
มีผู้ประเมินอิสระ |
| Status |
ตีพิมพ์แล้ว |
| Level of Publication |
นานาชาติ |
| citation |
false |
| Part of thesis |
true |
| Attach file |
|
| Citation |
0
|
|
|
|
|
|
|
|
|
Journal Publication
ไทย