Sciweavers

DM
2007
123views more  DM 2007»
13 years 10 months ago
Totally anti-symmetric quasigroups for all orders n =/ 2, 6
A quasigroup (Q, ∗) is called totally anti-symmetric if (c ∗ x) ∗ y = (c ∗ y) ∗ x ⇒ x = y and x∗y = y∗x ⇒ x = y. A totally anti-symmetric quasigroup can be used ...
H. Michael Damm
DM
2007
59views more  DM 2007»
13 years 10 months ago
Non-existence of nonorientable regular embeddings of n-dimensional cubes
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
Young Soo Kwon, Roman Nedela
DM
2007
77views more  DM 2007»
13 years 10 months ago
Quadrangularly connected claw-free graphs
A graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a sequence of l-cycles (3 ≤ l ≤ 4)
MingChu Li, Cheng Guo, Liming Xiong, Dengxin Li, H...
DM
2007
116views more  DM 2007»
13 years 10 months ago
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. ...
DM
2007
68views more  DM 2007»
13 years 10 months ago
Constructions and bounds for (m, t)-splitting systems
D. Deng, Douglas R. Stinson, Pak Ching Li, G. H. J...
DM
2007
55views more  DM 2007»
13 years 10 months ago
On the number of closed walks in vertex-transitive graphs
Robert Jajcay, Aleksander Malnic, Dragan Marusic
DM
2007
53views more  DM 2007»
13 years 10 months ago
The spectrum of Platonic graphs over finite fields
Michelle R. DeDeo, Dominic Lanphier, Marvin Minei
DM
2007
57views more  DM 2007»
13 years 10 months ago
Triangulated neighborhoods in even-hole-free graphs
An even-hole-free graph is a graph that does not contain, as an induced subgraph, a chordless cycle of even length. A graph is triangulated if it does not contain any chordless cy...
Murilo Vicente Gonçalves da Silva, Kristina...
DM
2007
98views more  DM 2007»
13 years 10 months ago
Fast recognition of classes of almost-median graphs
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Pe...
DM
2007
86views more  DM 2007»
13 years 10 months ago
Short cycle connectivity
Short cycle connectivity is a generalization of ordinary connectivity—two vertices have to be connected by a sequence of short cycles, in which two consecutive cycles have at le...
Vladimir Batagelj, Matjaz Zaversnik