36781 search results - page 59 / 7357 » Parameterizing by the Number of Numbers |
DM
2008
13 years 10 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
EJC
2008
13 years 10 months ago
2008
In this paper, we compute the congruences of Catalan and Motzkin numbers modulo 4 and 8. in particular, we prove the conjecture proposed by Deutsch and Sagan that no Motzkin numbe...
AOR
2006
13 years 10 months ago
2006
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d = d(n) such that, for every instance I of the Asymmetric TSP on n cities, A pro...
COMBINATORICA
2006
13 years 10 months ago
2006
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...