3 search results - page 1 / 1 » A counterexample to the Alon-Saks-Seymour conjecture and rel... |
ECCC
2010
12 years 11 months ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
ECAI
2004
Springer
13 years 8 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
COCOON
2003
Springer
13 years 10 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...