𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex Partitions of K4,4-Minor Free Graphs

✍ Scribed by Leif K. Jørgensen

Publisher
Springer Japan
Year
2001
Tongue
English
Weight
121 KB
Volume
17
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Precoloring extension for K4-minor-free
Precoloring extension for K4-minor-free graphs
✍ Anja Pruchnewski; Margit Voigt 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB 👁 1 views

## Abstract Let __G__=(__V, E__) be a graph where every vertex __v__∈__V__ is assigned a list of available colors __L__(__v__). We say that __G__ is list colorable for a given list assignment if we can color every vertex using its list such that adjacent vertices get different colors. If __L__(__v_

On vertex k-partitions of certain infini
On vertex k-partitions of certain infinite graphs
✍ Douglas Cenzer; Edward Howorka 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 826 KB

Let G be an infinite graph; define de& G to be the least m such that any partition P of the vertex set of G into sets of uniformly bounded cardinality contains a set which is adjacent to at least m Other sets of the partition. If G is either a regular tree 01 a triangtiisr, sqzart or hexagonal plana

Vertex partitions of chordal graphs
Vertex partitions of chordal graphs
✍ David R. Wood 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB

## Abstract A __k‐tree__ is a chordal graph with no (__k__ + 2)‐clique. An ℓ‐__tree‐partition__ of a graph __G__ is a vertex partition of __G__ into ‘bags,’ such that contracting each bag to a single vertex gives an ℓ‐tree (after deleting loops and replacing parallel edges by a single edge). We pro

Choosability of K5-minor-free graphs
Choosability of K5-minor-free graphs
✍ Riste Sˇkrekovski 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Thomassen, 1994 showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all Ks-minor-free graphs are 5-choosable. (~) 1998 Elsevier Science B.V.

Note on vertex-partitions of infinite gr
Note on vertex-partitions of infinite graphs
✍ János Pach; Joel H. Spencer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Given an infinite graph G, let deg,(G) be defined as the smallest d for which V(G) can be partitioned into finite subsets of (uniformly) bounded size such that each part is adjacent to at most d others. A countable graph G is constructed with de&(G) > 2 and with the property that [{y~V(G):d(x, y)sn}