2310 search results - page 102 / 462 » Coloring Random Graphs |
RSA
2002
13 years 10 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
EJC
2008
13 years 10 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
RSA
2011
13 years 5 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
COMBINATORICA
2008
13 years 10 months ago
2008
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
TIT
1998
13 years 9 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...