ENDM
2007
13 years 4 months ago
2007
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
ENDM
2007
13 years 4 months ago
2007
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
ENDM
2007
13 years 4 months ago
2007
For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not c...
ENDM
2007
13 years 4 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
ENDM
2007
13 years 4 months ago
2007
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
ENDM
2007
13 years 4 months ago
2007
For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker’...
ENDM
2007
13 years 4 months ago
2007
ENDM
2007
13 years 4 months ago
2007
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
ENDM
2007
13 years 4 months ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
ENDM
2007
13 years 4 months ago
2007