𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sufficient condition for planar partition functions

✍ Scribed by Burkard Polster


Publisher
Springer
Year
1995
Tongue
English
Weight
575 KB
Volume
65
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A sufficient condition for planar graphs
✍ Min Chen; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 216 KB πŸ‘ 1 views

## Abstract A proper vertex coloring of a graph __G__ = (__V, E__) is acyclic if __G__ contains no bicolored cycle. Given a list assignment __L__ = {__L__(__v__)|__v__∈__V__} of __G__, we say __G__ is acyclically __L__‐list colorable if there exists a proper acyclic coloring Ο€ of __G__ such that Ο€(

A sufficient condition for invexity
✍ Morgan A Hanson; Norma G Rueda πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 214 KB