𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitioning a Planar Graph of Girth 10 into a Forest and a Matching

✍ Scribed by A. Bassa; J. Burns; J. Campbell; A. Deshpande; J. Farley; M. Halsey; S.-Y. Ho; D. Kleitman; S. Michalakis; P.-O. Persson; P. Pylyavskyy; L. Rademacher; A. Riehl; M. Rios; J. Samuel; B. E. Tenner; A. Vijayasarathy; L. Zhao

Book ID
111015057
Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
130 KB
Volume
124
Category
Article
ISSN
0022-2526

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On universal graphs for planar oriented
On universal graphs for planar oriented graphs of a given girth
✍ O.V. Borodin; A.V. Kostochka; J. NeΕ‘etΕ™il; A. Raspaud; E. Sopena πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 662 KB

The oriented chromatic number o(H) of an oriented graph H is defined to be the minimum order of an oriented graph H' such that H has a homomorphism to H'. If each graph in a class ~ has a homomorphism to the same H', then H' is ~-universal. Let ~k denote the class of orientations of planar graphs wi

Partitioning a graph into defensivek-all
Partitioning a graph into defensivek-alliances
✍ Ismael G. Yero; Sergio Bermudo; Juan A. RodrΓ­guez-VelΓ‘zquez; JosΓ© M. Sigarreta πŸ“‚ Article πŸ“… 2010 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 230 KB