✦ LIBER ✦

On minimal elementary bipartite graphs

✍ Scribed by L Lovász; M.D Plummer

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 587 KB
Volume: 23
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90062-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Elementary Bipartite Graphs and Unique C

Elementary Bipartite Graphs and Unique Colourability

✍ Gábor Bacsó 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 44 KB

The Clique-Pair-Conjecture (CPC) states that a uniquely colourable perfect graph, different from a clique, contains two maximum size cliques having a two element symmetric difference. One can make an auxiliary graph B from a minimal counterexample for the CPC (if any exists), this B is bipartite. We

On bipartite tetravalent graphs

✍ D.H. Smith 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 560 KB

In [ IO, 1 I 1 all non-bipartite distance-transitive graphs of vallency four have been determined. e use a result of Gardinrzr [ 4 ] to enable us to determine thf: bipar ite distance-transitive graphs of valency four. We wx tht definitio s and notation o H wish to exp C'ollege, withou ould not have

A note on minimal order of a bipartite g

A note on minimal order of a bipartite graph with exactly q quadrilaterals

✍ Mariusz Woźniak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 206 KB

note on minimal order of a bipartite graph with exactly 4 quadrilaterals, Discrete Mathematics 121 (1993) 229-233. We show that the minimal order of a bipartite graph having exactly 4 quadrilaterals is asymptotically equal to 2fl $j (as 4 tends to infinity).

Coloring Locally Bipartite Graphs on Sur

Coloring Locally Bipartite Graphs on Surfaces

✍ Bojan Mohar; Paul D. Seymour 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 129 KB

It is proved that there is a function f: N Q N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-width \ f(g). Then (i) If every contractible 4-cycle of G is facial and there is a face of size > 4, then G is 3-colorable.

On equitable coloring of bipartite graph

On equitable coloring of bipartite graphs

✍ Ko-Wei Lih; Pou-Lin Wu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 285 KB

If the vertices of a graph G are partitioned into k classes V~, I/2 ..... Vk such that each V~ is an independent set and I1V~I-IV~[I ~< 1 for all i#j, then G is said to be equitably colored with k colors. The smallest integer n for which G can be equitably colored with n colors is called the equitab

On Ramsey graphs without bipartite subgr

On Ramsey graphs without bipartite subgraphs

✍ Jaroslav Nešetřil; Vojtěch Rödl 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 388 KB

NeSetfil, J. and V. Riidl, On Ramsey graphs without bipartite subgraphs, Discrete Mathematics 101 (1992) 223-229. We prove that for every graph H without triangles and K,,,,,m, n G 2, there exists a Ramsey graph with the same properties. This answers a problem due to Erd& and Faudree. Moreover we