List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok
نویسندگان
چکیده
منابع مشابه
total dominator chromatic number of a graph
given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...
متن کاملSome relations among term rank, clique number and list chromatic number of a graph
Let G be a graph with a nonempty edge set, we denote the rank of the adjacency matrix of G and term rank of G, by rk(G) and Rk(G), respectively. van Nuffelen conjectured that for any graph G, (G) rk(G). The first counterexample to this conjecture was obtained by Alon and Seymour. In 2002, Fishkind and Kotlov proved that for any graph G, (G) Rk(G). Here we improve this upper bound and show that ...
متن کاملA new result on chromaticity of K4-homoemorphs with girth 9
For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...
متن کاملNOTE - List Colouring when the Chromatic Number is Close to the Order of the Graph
An instance of List Colouring consists of a graph G and a list L(v) of colours for each vertex v of G. We are asked to determine if there is an acceptable colouring of G, that is a colouring in which each vertex receives a colour from its list, and no edge has both its endpoints coloured with the same colour. The list-chromatic number of G, denoted χl(G) is the minimum integer k such that for e...
متن کاملChromatically Unique Multibridge Graphs
Let θ(a1, a2, · · · , ak) denote the graph obtained by connecting two distinct vertices with k independent paths of lengths a1, a2, · · · , ak respectively. Assume that 2 ≤ a1 ≤ a2 ≤ · · · ≤ ak. We prove that the graph θ(a1, a2, · · · , ak) is chromatically unique if ak < a1 + a2, and find examples showing that θ(a1, a2, · · · , ak) may not be chromatically unique if ak = a1 + a2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Selecciones Matemáticas
سال: 2019
ISSN: 2411-1783
DOI: 10.17268/sel.mat.2019.01.04