✦ LIBER ✦

On the total coloring of certain graphs

✍ Scribed by M. Rosenfeld

Book ID: 112888987
Publisher: The Hebrew University Magnes Press
Year: 1971
Tongue: English
Weight: 248 KB
Volume: 9
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02771690

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On adjacent-vertex-distinguishing total

On adjacent-vertex-distinguishing total coloring of graphs

✍ Zhongfu Zhang; Xiang’en Chen; Jingwen Li; Bing Yao; Xinzhong Lu; Jianfang Wang 📂 Article 📅 2005 🏛 SP Science China Press 🌐 English ⚖ 168 KB

On Total Colorings of Graphs

✍ C. Mcdiarmid; B. Reed 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 299 KB

AND Bruce Reed Department of Combinatorics and Optimisation, University of Waterloo, Waterloo, Ontario, Canada

Applications of hypergraph coloring to c

Applications of hypergraph coloring to coloring graphs not inducing certain trees

✍ H.A. Kierstead; V. Rodl 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 385 KB

We present a simple result on coloring hypergraphs and use it to obtain bounds on the chromatic number of graphs which do not induce certain trees. ## O. Introduction A class of graphs F is said to be x-bounded if there exists a functionfsuch that for all graphs G e F, (.) z(G) <~f(og(G)), where

On the adjacent-vertex-strongly-distingu

On the adjacent-vertex-strongly-distinguishing total coloring of graphs

✍ ZhongFu Zhang; Hui Cheng; Bing Yao; JingWen Li; XiangEn Chen; BaoGen Xu 📂 Article 📅 2008 🏛 SP Science China Press 🌐 English ⚖ 211 KB

On total 9-coloring planar graphs of max

On total 9-coloring planar graphs of maximum degree seven

✍ Sanders, Daniel P.; Zhao, Yue 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 3 views

Given a graph G, a total k-coloring of G is a simultaneous coloring of the vertices and edges of G with at most k colors. If ∆(G) is the maximum degree of G, then no graph has a total ∆-coloring, but Vizing conjectured that every graph has a total (∆ + 2)-coloring. This Total Coloring Conjecture rem

D(β)-vertex-distinguishing total colorin

D(β)-vertex-distinguishing total coloring of graphs

✍ Zhongfu Zhang; Jingwen Li; Xiang’en Chen; Bing Yao; Wenjie Wang; Pengxiang Qiu 📂 Article 📅 2006 🏛 SP Science China Press 🌐 English ⚖ 204 KB