110 search results - page 13 / 22 » endm 2010 |
ENDM
2007
13 years 6 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 6 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 6 months ago
2007
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial i...
ENDM
2000
13 years 6 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
ENDM
2000
13 years 6 months ago
2000
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no ...