✦ LIBER ✦

On a Minor-Monotone Graph Invariant

✍ Scribed by H Vanderholst; M Laurent; A Schrijver

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 558 KB
Volume: 65
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1056

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A minor-monotone graph parameter based o

A minor-monotone graph parameter based on oriented matroids

✍ Jack Edmonds; Monique Laurent; Alexander Schrijver 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 573 KB

For an undirected graph G = (V,E) let i'(G) be the largest d for which there exists an oriented matroid M on V of corank d such that for each nonzero vector (x+,x-) of M, x+ is nonempty and induces a connected subgraph of G. We show that I'(G) is monotone under taking minors and clique sums. Moreov

On vertex partitions and some minor-mono

On vertex partitions and some minor-monotone graph parameters

✍ D. Gonçalves 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

We study vertex partitions of graphs according to some minormonotone graph parameters. Ding et al. [J Combin Theory Ser B 79(2) (2000), 221-246] proved that some minor-monotone parameters are such that, any graph G with (G) ≥ 2 admits a vertex partition into two graphs with parameter at most (G)-1.

Invariant monotone vector fields on Riem

Invariant monotone vector fields on Riemannian manifolds

✍ A. Barani; M.R. Pouryayevali 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 528 KB

Various concepts of invariant monotone vector fields on Riemannian manifolds are introduced. Some examples of invariant monotone vector fields are given. Several notions of invexities for functions on Riemannian manifolds are defined and their relations with invariant monotone vector fields are stud

On computing graph minor obstruction set

On computing graph minor obstruction sets

✍ Kevin Cattell; Michael J. Dinneen; Rodney G. Downey; Michael R. Fellows; Michael 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 149 KB

The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural graph properties are characterized by a ÿnite set of forbidden substructures, the obstructions for the property. We prove several general theorems regarding the computation of obstruction sets from other

Graph coloring and monotone functions on

Graph coloring and monotone functions on posets

✍ Nathan Linial 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 79 KB

The purpose of this note is to point out a relationship between graph coloring and monotone functions defined on posets. This relationship permits us to deduce certain properties of the chromatic polynomial of a graph.

A universal planar graph under the minor

A universal planar graph under the minor relation

✍ Diestel, Reinhard; K�hn, Daniela 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 488 KB 👁 3 views

planar graph that contains every planar graph as a minor.