547 search results - page 83 / 110 » dm 2008 |
101
Voted
DM
2007
15 years 22 days 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...
82
Voted
DM
2007
15 years 22 days 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...
72
Voted
DM
2007
15 years 22 days ago
2007
We show that each polynomial a(z)=1+a1z+· · ·+adzd in N[z] having only real zeros is the f-polynomial of a multicomplex. It follows that a(z) is also the h-polynomial of a Cohe...
78
Voted
DM
2007
15 years 22 days ago
2007
We consider matroidal structures on convex geometries, which we call cg-matroids. The concept of a cg-matroid is closely related to but different from that of a supermatroid intro...
109
Voted
DM
2007
15 years 22 days ago
2007
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...