✦ LIBER ✦

Random near-regular graphs and the node packing problem

✍ Scribed by G.R Grimmett; W.R Pulleyblank

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact threshold theorem for random gr

✍ G.R Grimmett 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 392 KB

The number of matchings in random regula

✍ B Bollobás; B.D McKay 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 475 KB

The Cover Time of Random Regular Graphs

✍ Cooper, Colin; Frieze, Alan 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 187 KB

On the independence and chromatic number

✍ A.M Frieze; T Łuczak 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 399 KB

The packing coloring problem for lobster

✍ Argiroffo, G.; Nasini, G.; Torres, P. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 407 KB

The complexity of the chromatic sum prob

✍ Michal Malafiejski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 12 KB