๐”– Bobbio Scriptorium
โœฆ   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

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
Vertex-distinguishing edge colorings of
โœ 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
โœ Ze-min Jin; Xue-liang Li ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› SP Editorial Committee of Applied Mathematics - A ๐ŸŒ English โš– 145 KB
Some undecidable problems involving the
โœ 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