On restricted edge-colorings of bicliques

15 years 2 months ago

Download www.math.uiuc.edu

We investigate the minimum and maximum number of colors in edge-colorings of Kn,n such that every copy of Kp,p receives at least q and at most q colors. Along the way we improve the bounds on some bipartite Tur

Dhruv Mubayi, Douglas B. West

Real-time Traffic

DM 2002 | Maximum Number |

claim paper

» OnLine EdgeColoring with a Fixed Number of Colors

» Clustering and the Biclique Partition Problem

» Termination of Multipartite Graph Series Arising from Complex Network Modelling

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DM
Authors	Dhruv Mubayi, Douglas B. West

Comments (0)

Sciweavers

On restricted edge-colorings of bicliques

DM 2002 | Maximum Number |

Explore & Download

Productivity Tools

Sciweavers