𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every graph is essentially sparse

✍ Scribed by Naor, Assaf


Book ID
120645372
Publisher
Association for Computing Machinery
Year
2013
Tongue
English
Weight
110 KB
Volume
56
Category
Article
ISSN
0001-0782

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Every regular graph is a quasigroup grap
✍ W. DΓΆrfler πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 344 KB

~~r~h-~~lland Publishing Company Receiwd 4 kbrurary 1974 \* ph-them-etic tei7ninolcllgy use in this nste, see [ 21; for alge-; a gxoupoid (i.e., a set with a binary mmposition) in whi rary two eleme the equations 42s = b and 332 =t I ueiy defined s d ~7. Since associative quasigroups are gmups, the

Every connected graph is a query graph
✍ Peter M. Winkler πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 173 KB

Let Vbe a set of bit strings of length k, i.e., V C {0, l}'. The query graph Q ( V ) is defined as follows: the vertices of Q(V) are the elements of V, and {O,V} is an edge of Q ( V ) if and only if no other W E Vagrees with U in all the positions in which V does. If Vrepresents the set of keys for

Every Planar Graph Is 5-Choosable
✍ C. Thomassen πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 56 KB

We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. ErdΓΆs, A. L. Rubin, and H. Taylor. (i) 1994 Academic Press, Inc.

Every Monotone Graph Property Is Testabl
✍ Alon, Noga; Shapira, Asaf πŸ“‚ Article πŸ“… 2008 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 225 KB