8 search results - page 1 / 2 » Anti-Ramsey Numbers of Subdivided Graphs |
JCT
2002
13 years 4 months ago
2002
DM
2008
13 years 5 months ago
2008
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
GC
2007
Springer
13 years 5 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
JGT
2011
13 years 5 days ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...