990 search results - page 69 / 198 » Sub-Graphs of Complete Graph |
COMBINATORICS
2000
13 years 9 months ago
2000
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...
ACSD
2003
IEEE
14 years 22 days ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
STACS
2010
Springer
14 years 1 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...