✦ LIBER ✦

On vertex-coloring edge-weighting of graphs

✍ Scribed by Hongliang Lu; Xu Yang; Qinglin Yu

Book ID: 107377936
Publisher: Higher Education Press and Springer
Year: 2009
Tongue: English
Weight: 159 KB
Volume: 4
Category: Article
ISSN: 1673-3452
DOI: 10.1007/s11464-009-0014-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On vertex-coloring 13-edge-weighting

✍ Tao Wang; Qinglin Yu 📂 Article 📅 2008 🏛 Higher Education Press and Springer 🌐 English ⚖ 126 KB

Efficient Vertex- and Edge-Coloring of O

Efficient Vertex- and Edge-Coloring of Outerplanar Graphs

✍ Proskurowski, Andrzej; Sysło, Maciej M. 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics ⚖ 780 KB

Applications of edge coloring of multigr

Applications of edge coloring of multigraphs to vertex coloring of graphs

✍ H.A. Kierstead 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 754 KB

Vertex-distinguishing edge colorings of

Vertex-distinguishing edge colorings of graphs

✍ P. N. Balister; O. M. Riordan; R. H. Schelp 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB 👁 1 views

Vertex partitions ofr-edge-colored graph

Vertex partitions ofr-edge-colored graphs

✍ Ze-min Jin; Xue-liang Li 📂 Article 📅 2008 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 145 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