✦ LIBER ✦

Bipartite graphs and their endomorphism monoids

✍ Scribed by Fan, Suohai

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 231 KB
Volume: 23
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199609)23:1<49::aid-jgt5>3.0.co;2-k

No coin nor oath required. For personal study only.

✦ Synopsis

It is shown that any connected bipartite graph is determined by its endomorphism monoid up to isomorphism.

📜 SIMILAR VOLUMES

On graphs with a given endomorphism mono

On graphs with a given endomorphism monoid

✍ Václav Koubek; Vojtěch Rödl; Benjamin Shemmer 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB 👁 1 views

## Abstract Hedrlín and Pultr proved that for any monoid **M** there exists a graph __G__ with endomorphism monoid isomorphic to **M**. In this paper we give a construction __G__(__M__) for a graph with prescribed endomorphism monoid **M**. Using this construction we derive bounds on the minimum nu

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

Perfect Elimination and Chordal Bipartit

Perfect Elimination and Chordal Bipartite Graphs

✍ Martin Charles Golumbic; Clinton F. Goss 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB

## Abstract We define two types of bipartite graphs, chordal bipartite graphs and perfect elimination bipartite graphs, and prove theorems analogous to those of Dirac and Rose for chordal graphs (rigid circuit graphs, triangulated graphs). Our results are applicable to Gaussian elimination on spars

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