𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stability Critical Graphs and Even Subdivisions of K4

✍ Scribed by E.C. Sewell; L.E. Trotter

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
375 KB
Volume
59
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular 4-critical graphs of even degree
Regular 4-critical graphs of even degree
✍ Andrey A. Dobrynin; Leonid S. Melnikov; Artem V. Pyatkin 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 1 views

## Abstract In 1960, Dirac posed the conjecture that __r__‐connected 4‐critical graphs exist for every __r__ ≥ 3. In 1989, Erdős conjectured that for every __r__ ≥ 3 there exist __r__‐regular 4‐critical graphs. In this paper, a technique of constructing __r__‐regular __r__‐connected vertex‐transiti

Chromatic-index-critical graphs of even
Chromatic-index-critical graphs of even order
✍ Gr�newald, Stefan; Steffen, Eckhard 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB 👁 2 views

A k-critical (multi-) graph G has maximum degree k, chromatic index χ (G) = k + 1, and χ (G -e) < k + 1 for each edge e of G. For each k ≥ 3, we construct k-critical (multi-) graphs with certain properties to obtain counterexamples to some well-known conjectures.

Subdivisions of large complete bipartite
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs
✍ Thomas Böhme; Bojan Mohar; Riste Škrekovski; Michael Stiebitz 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 1 views

## Abstract It is proved that for every positive integers __k__, __r__ and __s__ there exists an integer __n__ = __n__(__k__,__r__,__s__) such that every __k__‐connected graph of order at least __n__ contains either an induced path of length __s__ or a subdivision of the complete bipartite graph __

K4-free graphs with no odd hole: Even pa
K4-free graphs with no odd hole: Even pairs and the circular chromatic number
✍ Yori Zwols 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

An odd hole in a graph is an induced cycle of odd length at least five. In this article we show that every imperfect K 4 -free graph with no odd hole either is one of two basic graphs, or has an even pair or a clique cutset. We use this result to show that every K 4 -free graph with no odd hole has