Total chromatic number of graphs of high degree, II
نویسندگان
چکیده
منابع مشابه
The Total Chromatic Number of Graphs of High Minimum Degree
If G is a simple graph with minimum degree <5(G) satisfying <5(G) ^ f(| K(C?)| -f-1) the total chromatic number conjecture holds; moreover if S(G) ^ f| V(G)\ then #T(G) < A(G) + 3. Also if G has odd order and is regular with d{G) ^ \^/1\V{G)\ then a necessary and sufficient condition for ^T((7) = A((7)+ 1 is given.
متن کاملThe total chromatic number of regular graphs of even order and high degree
The total chromatic number T (G) of a graph G is the minimum number of colours needed to colour the edges and the vertices ofG so that incident or adjacent elements have distinct colours. We show that if G is a regular graph of even order and (G) 3 |V (G)| + 23 6 , then T (G) (G)+ 2. © 2005 Elsevier B.V. All rights reserved.
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملTotal-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly chordal graphs and interval graphs. We prove that Vizing's total-colour conjecture holds for dually chordal graphs. We describe a new heuristi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1992
ISSN: 0263-6115
DOI: 10.1017/s1446788700035801