✦ LIBER ✦

A Design for (d, k) Graphs

✍ Scribed by Friedman, Henry D.

Book ID: 114587130
Publisher: Institute of Electrical and Electronics Engineers
Year: 1966
Tongue: English
Weight: 286 KB
Volume: EC-15
Category: Article
ISSN: 0367-7508
DOI: 10.1109/pgec.1966.264310

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On (d, k) Graphs

✍ Korn, Israel 📂 Article 📅 1967 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 227 KB

Improved Construction Techniques for (d,

Improved Construction Techniques for (d, k) Graphs

✍ Storwick, R.M. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 402 KB

On (d, k, μ) Graphs

✍ Quaife, H.J. 📂 Article 📅 1969 🏛 IEEE 🌐 English ⚖ 689 KB

FORS: A graph based design environment

✍ N.P. Papanikolopoulos 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 984 KB

On the Construction of (d, k) Graphs

✍ Akers, Sheldon B. 📂 Article 📅 1965 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 195 KB

A special k-coloring for a connected k-c

A special k-coloring for a connected k-chromatic graph

✍ Guantao Chen; Richard H. Schelp; Warren E. Shreve 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 293 KB

For each positive integer k we consider the smallest positive integer f(k) (dependent only on k) such that the following holds: Each connected graph G with chromatic number x(G) --k can be properly vertex colored by k colors so that for each pair of vertices x0 and x~ in any color class there exist