✦ LIBER ✦

-degree closures for graphs

✍ Scribed by Ahmed Ainouche

Book ID: 108114068
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 494 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.07.036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Ahmed Ainouche 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Speeding up dynamic transitive closure f

Speeding up dynamic transitive closure for bounded degree graphs

✍ Daniel M. Yellin 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 974 KB

0-Dual Closures for Several Classes of G

0-Dual Closures for Several Classes of Graphs

✍ Ahmed Ainouche; Ingo Schiermeyer 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 323 KB

Closure, clique covering and degree cond

Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs

✍ Roman Kužel; Zdeněk Ryjáček; Jakub Teska; Petr Vrána 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 729 KB

Minimum degree games for graphs

✍ Daniel M. Gordon; Robert W. Robinson; Frank Harary 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 792 KB

Closure, connectivity and degree distrib

Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social networks

✍ Garry Robins; Pip Pattison; Peng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 1005 KB

New specifications for exponential random graph models. Sociological Methodology 36, exhibit substantial improvements in model fit compared with the commonly used Markov random graph models. Snijders et al., however, concentrated on non-directed graphs, with only limited extensions to directed graph