✦ LIBER ✦

A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM

✍ Scribed by Mark E. Watkins

Book ID: 114879209
Publisher: John Wiley and Sons
Year: 1970
Tongue: English
Weight: 212 KB
Volume: 175
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1970.tb56499.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial algorithm for the extendabi

A polynomial algorithm for the extendability problem in bipartite graphs

✍ J. Lakhal; L. Litzler 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Let G = [ y E] be a simple connected graph and let k be an integer such that 0 < k < 1 VI /2. G is said to be k-extendable if it contains a perfect matching and every matching of k edges extends to, i.e. is a subset of, a perfect matching. The extendability problem consists in finding the maximum va

An extremal problem for paths in biparti

An extremal problem for paths in bipartite graphs

✍ A. Gyárfás; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

Isomorphism problem for a special class

Isomorphism problem for a special class of graphs

✍ D. Ź. Djoković 📂 Article 📅 1970 🏛 Akadmiai Kiad 🌐 English ⚖ 172 KB

A convexity upper bound for the number o

A convexity upper bound for the number of maximal bicliques of a bipartite graph

✍ Albano, Alexandre; do Lago, Alair Pereira 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 426 KB

A special antidilation problem for meshe

A special antidilation problem for meshes and Hamming graphs

✍ L’ubomír Török; Imrich Vrt’o 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 209 KB

A successful concept for measuring non-p

A successful concept for measuring non-planarity of graphs: the crossing number

✍ László A. Székely 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 329 KB