Search Sciweavers | Sciweavers

157 search results - page 3 / 32

» Frugal Colouring of Graphs

click to vote

SIGECOM
2003
ACM

124views ECommerce» more SIGECOM 2003»

Coalitional games on graphs: core structure, substitutes and frugality

14 years 1 months ago

Download www.cse.buffalo.edu

We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...

Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma

claim paper

Read More »

104

click to vote

Book

1197views

Graph Theory with Applications

15 years 5 months ago

Download www.ecp6.jussieu.fr

A classic book on graph theory.

J.A. Bondy and U.S.R. Murty

posted by scimaster

Read More »

click to vote

COMBINATORICS
2006

116views more COMBINATORICS 2006»

Neighbour-Distinguishing Edge Colourings of Random Regular Graphs

13 years 7 months ago

Download web.maths.unsw.edu.au

A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...

Catherine S. Greenhill, Andrzej Rucinski

claim paper

Read More »

click to vote

JCT
2010

74views more JCT 2010»

Claw-free graphs VI. Colouring

13 years 2 months ago

Download www.math.princeton.edu

Maria Chudnovsky, Paul D. Seymour

claim paper

Read More »

click to vote

COMBINATORICS
2006

121views more COMBINATORICS 2006»

Edge and Total Choosability of Near-Outerplanar Graphs

13 years 7 months ago

Download www.univie.ac.at

It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...

Timothy J. Hetherington, Douglas R. Woodall

claim paper

Read More »

« Prev « First page 3 / 32 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers