376 search results - page 41 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
JGT
2010
13 years 3 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
COLOGNETWENTE
2009
13 years 9 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
CCCG
2004
13 years 10 months ago
2004
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
SPAA
1990
ACM
14 years 21 days ago
1990
ACM
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...