Sciweavers

DM
2006
66views more  DM 2006»
13 years 4 months ago
On the role of hypercubes in the resonance graphs of benzenoid graphs
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perfect matchings being adjacent13 if their symmetric difference forms the edge set...
Khaled Salem, Sandi Klavzar, Ivan Gutman
DM
2006
54views more  DM 2006»
13 years 4 months ago
Enumeration of M-partitions
Øystein J. Rødseth
DM
2006
144views more  DM 2006»
13 years 4 months ago
On almost self-complementary graphs
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
Primoz Potocnik, Mateja Sajna
DM
2006
55views more  DM 2006»
13 years 4 months ago
The intricacy of avoiding arrays is 2
Lars-Daniel Öhman
DM
2006
75views more  DM 2006»
13 years 4 months ago
Counting occurrences of 231 in an involution
Toufik Mansour, Sherry H. F. Yan, Laura L. M. Yang
DM
2006
79views more  DM 2006»
13 years 4 months ago
Restricted even permutations and Chebyshev polynomials
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In sever...
Toufik Mansour
DM
2006
71views more  DM 2006»
13 years 4 months ago
Spanning trails containing given edges
Weiqi Luo, Zhi-Hong Chen, Wei-Guo Chen
DM
2006
93views more  DM 2006»
13 years 4 months ago
Consistency for partition regular equations
It is easy to deduce from Ramsey's Theorem that, given positive integers a1, a2, . . . , am and a finite colouring of the set N of positive integers, there exists an injectiv...
Imre Leader, Paul A. Russell
DM
2006
71views more  DM 2006»
13 years 4 months ago
Tight quadrangulations on the sphere
Hideo Komuro, Kiyoshi Ando, Atsuhiro Nakamoto