114 search results - page 4 / 23 » On Infinite Cycles II |
DM
2002
13 years 9 months ago
2002
It is known that the chromatic polynomial of any chordal graph has only integer roots. However, there also exist non-chordal graphs whose chromatic polynomials have only integer r...
COMBINATORICS
2004
13 years 9 months ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
WSC
1997
13 years 11 months ago
1997
This paper studies activity cycle diagrams (ACD) for modeling construction processes using activities as the basic elements. An ACD is obtained by combining the activity cycles of...
NETWORKS
2006
13 years 9 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...