DM
2006
13 years 5 months ago
2006
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...
DM
2006
13 years 5 months ago
2006
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
DM
2006
13 years 5 months ago
2006
Let {v; b2, b1} denote the class of extended directed triple systems of the order v in which the number of blocks of the form [a, b, a] is b2 and
DM
2006
13 years 5 months ago
2006
DM
2006
13 years 5 months ago
2006
The simple device of maximization over subsets of events can provide substantial improvement over the Dawson
DM
2006
13 years 5 months ago
2006
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spann...
DM
2006
13 years 5 months ago
2006
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
DM
2006
13 years 5 months ago
2006
Fibonacci cube is a subgraph of hypercube induced on vertices without two consecutive 1's. If we remove from Fibonacci cube the vertices with 1 both in the first and the last...
DM
2006
13 years 5 months ago
2006
The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being `eccentric'; that is, there is an arc from u to v in ED(G)...
DM
2006
13 years 5 months ago
2006