✦ LIBER ✦

A structural theorem for planar graphs with some applications

✍ Scribed by Huiyu Sheng; Yingqian Wang

Book ID: 108112926
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 264 KB
Volume: 159
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.03.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some structural properties of planar gra

Some structural properties of planar graphs and their applications to 3-choosability

✍ Min Chen; Mickaël Montassier; André Raspaud 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 461 KB

A theorem on permutation graphs with app

A theorem on permutation graphs with applications

✍ Yu Chang-Wu; Chen Gen-Huey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 906 KB

Some Graph-Colouring Theorems with Appli

Some Graph-Colouring Theorems with Applications to Generalized Connection Networks

✍ Kirkpatrick, David G.; Klawe, Maria; Pippenger, Nicholas 📂 Article 📅 1985 🏛 Society for Industrial and Applied Mathematics ⚖ 905 KB

An edge-coloration theorem for bipartite

An edge-coloration theorem for bipartite graphs with applications

✍ Ram Prakash Gupta 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 776 KB

Some applications of Vizing's theorem to

Some applications of Vizing's theorem to vertex colorings of graphs

✍ Henry A. Kierstead; James H. Schmerl 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 812 KB

In this paper we shall study the relationships between the following three families of assertions: C(n): If G is a graph that does not induce & or KS-e and w(G) 6 n. then x(G)rn+l. C'(n): If M is a multigraph such that A(M)< n, p(M)<2 and M does not contain a S-sided triangle (i.e., a triangle with

A Kuratowski-type theorem for planarity

A Kuratowski-type theorem for planarity of partially embedded graphs

✍ Vít Jelínek; Jan Kratochvíl; Ignaz Rutter 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 632 KB