122 search results - page 16 / 25 » On pancyclism in hamiltonian graphs |
DAM
1998
14 years 11 months ago
1998
We consider edge-coloured complete graphs. A path or cycle Q is called properly coloured (PC) if any two adjacent edges of Q differ in colour. Our note is inspired by the followi...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
DM
2002
14 years 11 months ago
2002
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with + 2 colors, where is the maximum degree of a graph. Although this conjecture was solved in ...
JAIR
1998
14 years 11 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
123
click to vote
DM
2011
14 years 6 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...