DM
2007
13 years 11 months ago
2007
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
DM
2007
13 years 11 months ago
2007
In this note we continue the study of gaps in samples of geometric random variables originated in Hitczenko and Knopfmacher [Gap-free compositions and gap-free samples of geometri...
DM
2007
13 years 11 months ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...
DM
2007
13 years 11 months ago
2007
DM
2007
13 years 11 months ago
2007
Arrow’s impossibility theorem [1] shows that the set of acyclic tournaments is not closed to non dictatorial Boolean aggregation. In this paper we extend the notion of aggregati...
DM
2007
13 years 11 months ago
2007
For a tree T and an integer k ≥ 1, it is well known that the k-th power T k of T is strongly chordal and hence has a strong elimination ordering of its vertices. In this note we...
DM
2007
13 years 11 months ago
2007
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
DM
2007
13 years 11 months ago
2007
The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are fo...
DM
2007
13 years 11 months ago
2007
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...
DM
2007
13 years 11 months ago
2007
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.