DM
2007
13 years 11 months ago
2007
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 ...
DM
2007
13 years 11 months ago
2007
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...
DM
2007
13 years 11 months ago
2007
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)
DM
2007
13 years 11 months ago
2007
: 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...
DM
2007
13 years 11 months ago
2007
DM
2007
13 years 11 months ago
2007
DM
2007
13 years 11 months ago
2007
DM
2007
13 years 11 months ago
2007
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...
DM
2007
13 years 11 months ago
2007
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...
DM
2007
13 years 11 months ago
2007
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...