✦ LIBER ✦

Vertex maps on graphs-trace theorems

✍ Scribed by Chris Bernhardt

Book ID: 115021629
Publisher: Springer International Publishing AG
Year: 2011
Tongue: English
Weight: 278 KB
Volume: 2011
Category: Article
ISSN: 1687-1820
DOI: 10.1186/1687-1812-2011-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a theorem about vertex colorings of g

On a theorem about vertex colorings of graphs

✍ Claudio Bernardi 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 121 KB

Lawrence [2, Theorem 3] and Borodin and Kostochka [1, Lemma 2' 1 both give the same theorem about vertex colorings of graphs (Corollary 1 below). But Lawrence's proof, although powerful, is a little long, and Borodin and Kostoehka state the result without a proof.

The Separator Theorem for Rooted Directe

The Separator Theorem for Rooted Directed Vertex Graphs

✍ B.S. Panda 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

In this note we point out a flaw in the separator theorem for rooted directed vertex graphs due to C. L. Monma and V. K. Wei (1986, J. Combin. Theory Ser. B 41, 141 181), and present a modified separator theorem for the same class of graphs.

An 11-vertex theorem for 3-connected cub

An 11-vertex theorem for 3-connected cubic graphs

✍ R. E. L. Aldred; BauSheng; D. A. Holton; Gordon F. Royle 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 451 KB 👁 1 views

In this paper w e determine the circumstances under which a set of 11 vertices in a 3-connected cubic graph lies on a cycle. In addition, w e consider the number of such cycles that exist and characterize those graphs in which a set of 9 vertices lies in exactly two cycles.

Representation theorems for graphs whose

Representation theorems for graphs whose the vertex set is partially ordered

✍ Alain Quilliot 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 768 KB

## Dedicated to E. Corominas Given a graph G =(X, E), we try to know when it is possible to consider G as the intersection graph of a finite hypergraph, when some restrietions are given on the inclusion order induced on the edge set of this hypergraph. We give some examples concerning the interva

On limit graphs of finite vertex-primiti

On limit graphs of finite vertex-primitive graphs

✍ Michael Giudici; Cai Heng Li; Cheryl E. Praeger; Ákos Seress; Vladimir I. Trofim 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Four vertex theorems on Lorentzian spher

Four vertex theorems on Lorentzian spheresS12andH12

✍ Dzan Jin Jee 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 333 KB