✦ LIBER ✦

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

✍ Scribed by Albano, Alexandre; do Lago, Alair Pereira

Book ID: 120883999
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 426 KB
Volume: 165
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.01.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of maximal bipartite subgr

On the number of maximal bipartite subgraphs of a graph

✍ Jesper Makholm Byskov; Bolette Ammitzbøll Madsen; Bjarke Skjernaa 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

We show new lower and upper bounds on the maximum number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105 n=10 % 1:5926 n ; such subgraphs show an upper bound of O(12 n=4 ) ¼ O(1:8613 n ) and give an algorithm that finds all maximal

An upper bound for the path number of a

An upper bound for the path number of a graph

✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe

A lower bound for the convexity number o

A lower bound for the convexity number of some graphs

✍ Byung Kee Kim 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 135 KB

The Convexity Number of a Graph

✍ Gary Chartrand; Curtiss E. Wall; Ping Zhang 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 143 KB

New upper bounds for the chromatic numbe

New upper bounds for the chromatic number of a graph

✍ Ladislav Stacho 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 55 KB 👁 3 views

An upper bound for the harmonious chroma

An upper bound for the harmonious chromatic number of a graph

✍ Sin-Min Lee; John Mitchem 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o