✦ LIBER ✦

Koszul Bipartite Graphs

✍ Scribed by Hidefumi Ohsugi; Takayuki Hibi

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 48 KB
Volume: 22
Category: Article
ISSN: 0196-8858
DOI: 10.1006/aama.1998.0615

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cellular Bipartite Graphs

✍ Hans-Jürgen Bandelt; Victor Chepoi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Packing two bipartite graphs into a comp

Packing two bipartite graphs into a complete bipartite graph

✍ Wang, Hong 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 3 views

For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove

Forbidden induced bipartite graphs

✍ Peter Allen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

## Abstract Given a fixed bipartite graph __H__, we study the asymptotic speed of growth of the number of bipartite graphs on __n__ vertices which do not contain an induced copy of __H__. Whenever __H__ contains either a cycle or the bipartite complement of a cycle, the speed of growth is ${{2}}^{\

Embeddings of bipartite graphs

✍ Mohammed Abu-Sbeih; T. D. Parsons 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB

Bichromaticity of bipartite graphs

✍ Dan Pritikin 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

Let 8 be a bipartite graph with edge set €and vertex bipartition M, N. The bichromaticity p ( 6) is defined as the maximum number p such that a complete bipartite graph on p vertices is obtainable from 5 by a sequence of identifications of vertices of M or vertices of N. Let p = max{lMI, IN\}. Hara

Distance Biregular Bipartite Graphs

✍ C. Delorme 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 392 KB

We describe here some properties of a class of graphs which extends the class of distance regular graphs: our graphs are bipartite and for cach vertex there exists an intersection array depending on the stable component of the vertex. Thus our graphs arc to distance regular graphs as bipartite regul