𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal reducible bounds for planar graphs

✍ Scribed by Mieczysław Borowiecki; Izak Broere; Peter Mihók

Book ID
108316396
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
92 KB
Volume
212
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimal reducible bound for outer
On the minimal reducible bound for outerplanar and planar graphs
✍ Peter Mihók 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Let L be the set of all additive and hereditary properties of graphs. For P1, P2 E L we define the reducible property R = P1P2 as follows: G E PtP2 if there is a bipartition (V~,/1"2) of V(G) such that (V~) E Pi and (V2) E P2. For a property P E L, a reducible property R is called a minimal reducibl

Diameter bounds for planar graphs
Diameter bounds for planar graphs
✍ Radoslav Fulek; Filip Morić; David Pritchard 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 313 KB
Homomorphism bounds for oriented planar
Homomorphism bounds for oriented planar graphs
✍ T. H. Marshall 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract If ${\cal C}$ is a class of oriented graphs (directed graphs without opposite arcs), then an oriented graph is a __homomorphism bound__ for ${\cal C}$ if there is a homomorphism from each graph in ${\cal C}$ to __H__. We find some necessary conditions for a graph to be a homomorphism bo