✦ LIBER ✦

On the vertex-distinguishing proper edge coloring of composition of complete graph and star

✍ Scribed by Yang, Fang; Chen, Xiang-en; Ma, Chunyan

Book ID: 122822153
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 356 KB
Volume: 114
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2013.11.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Vertex-Distinguishing Proper Edge

On the Vertex-Distinguishing Proper Edge-Colorings of Graphs

✍ Cristina Bazgan; Amel Harkat-Benhamdine; Hao Li; Mariusz Woźniak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 189 KB

We prove the conjecture of Burris and Schelp: a coloring of the edges of a graph of order n such that a vertex is not incident with two edges of the same color and any two vertices are incident with different sets of colors is possible using at most n+1 colors. 1999 Academic Press ## 1. Introducti

On the adjacent vertex-distinguishing eq

On the adjacent vertex-distinguishing equitable edge coloring of graphs

✍ Li, Jing-wen; Wang, Cong; Wang, Zhi-wen 📂 Article 📅 2013 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 218 KB

On the adjacent vertex-distinguishing ac

On the adjacent vertex-distinguishing acyclic edge coloring of some graphs

✍ Wai Chee Shiu; Wai Hong Chan; Zhong-fu Zhang; Liang Bian 📂 Article 📅 2011 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 196 KB

A note on the vertex-distinguishing prop

A note on the vertex-distinguishing proper coloring of graphs with large minimum degree

✍ Cristina Bazgan; Amel Harkat-Benhamdine; Hao Li; Mariusz Woźniak 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 76 KB

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

Some undecidable problems involving the

Some undecidable problems involving the edge-coloring and vertex-coloring of graphs

✍ Stefan A. Burr 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o