322 search results - page 9 / 65 » On Infinite Cycles I |
APPML
2007
14 years 9 months ago
2007
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
We report the implementation and evaluation of a Simulation Theory (ST) approach to the Theory of Mind in intelligent graphical agents driven by an affective agent architecture FA...
69
Voted
DM
2010
14 years 9 months ago
2010
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
ENTCS
2008
14 years 9 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
CORR
2008
Springer
14 years 9 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...