✦ LIBER ✦

Quickly Excluding a Planar Graph

✍ Scribed by N. Robertson; P. Seymour; R. Thomas

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 1014 KB
Volume: 62
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1073

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Excluding a bipartite circle graph from

Excluding a bipartite circle graph from line graphs

✍ Sang-il Oum 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

## Abstract We prove that, for a fixed bipartite circle graph __H__, all line graphs with sufficiently large rank‐width (or clique‐width) must have a pivot‐minor isomorphic to __H__. To prove this, we introduce graphic delta‐matroids. Graphic delta‐matroids are minors of delta‐matroids of line grap

On cleaving a planar graph

✍ Shankar M. Venkatesan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Decomposing a Planar Graph into Degenera

Decomposing a Planar Graph into Degenerate Graphs

✍ C. Thomassen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 477 KB

We prove the conjecture made by \(\mathrm{O}\). V. Borodin in 1976 that the vertex set of any planar graph can be decomposed into two sets such that one of them induces a 3-degenerate graph and the other induces a 2-degenerate graph. that is, a forest. c. 1995 Academic Press. Inc.

Properties of a planar cubic graph

✍ Shunichi Toida 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 506 KB

It is shown that a planar can always be to planar graph fewer vertices. It is shown if a planar cubic graph is edge-3colorable then the reduction of the number of its vertices is possible without changing colors of its edges.

A GRASP for graph planarization

✍ Resende, Mauricio G. C.; Ribeiro, Celso C. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB 👁 2 views

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. In this paper, we describe a GRASP for the graph planarization problem, extending the heuristic of Goldschmidt and Takvorian [ Networks 24 (1994) 69-73]. We review the basic concepts of GRASP: co

A note on planar graphs

✍ David P. Brown; Alan Budner 📂 Article 📅 1965 🏛 Elsevier Science 🌐 English ⚖ 612 KB

Some new properties of the distribution of elements and vertices with respect to the windows of a connected planar graph G are established. It is also shown that a window matrix of G has properties similar to the properties of an incidence matrix of a graph which is not necessarily planar. A method