DM
2006
13 years 11 months ago
2006
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collap...
DM
2006
13 years 11 months ago
2006
Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...
DM
2006
13 years 11 months ago
2006
Let 1 s1 < s2 <
DM
2006
13 years 11 months ago
2006
DM
2006
13 years 11 months ago
2006
We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are ...
DM
2006
13 years 11 months ago
2006
We give a characterization of the non-empty binary relations
DM
2006
13 years 11 months ago
2006
DM
2006
13 years 11 months ago
2006
The notion of the carvingwidth of a graph was introduced by Seymour and Thomas [Call routing and the ratcatcher, Combinatorica
DM
2006
13 years 11 months ago
2006
Let n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if for every subset S of n vertices and for every subset T of S, there is a vertex x / S whi...
DM
2006
13 years 11 months ago
2006
We explain some analytic methods that can be useful in solving Hex puzzles.