Sciweavers

DAM
2008
139views more  DAM 2008»
13 years 11 months ago
Covering symmetric semi-monotone functions
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-mo...
Roland Grappe, Zoltán Szigeti
DAM
2008
145views more  DAM 2008»
13 years 11 months ago
Unicyclic and bicyclic graphs having minimum degree distance
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
Alexandru Ioan Tomescu
DAM
2008
67views more  DAM 2008»
13 years 11 months ago
On the variance of Shannon products of graphs
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
József Balogh, Clifford D. Smyth
DAM
2008
111views more  DAM 2008»
13 years 11 months ago
Games played by Boole and Galois
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
Aviezri S. Fraenkel
DAM
2008
75views more  DAM 2008»
13 years 11 months ago
Equistable distance-hereditary graphs
Abstract. A graph is called equistable when there is a nonnegative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stab...
Ephraim Korach, Uri N. Peled, Udi Rotics
DAM
2008
134views more  DAM 2008»
13 years 11 months ago
Efficient algorithms for finding critical subgraphs
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...
DAM
2008
103views more  DAM 2008»
13 years 11 months ago
Crown reductions for the Minimum Weighted Vertex Cover problem
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...
Miroslav Chlebík, Janka Chlebíkov&aa...
DAM
2008
91views more  DAM 2008»
13 years 11 months ago
Media theory: Representations and examples
In this paper we develop a representational approach to media theory. We construct representations of media by well-graded families of sets and partial cubes and establish the uni...
Sergei Ovchinnikov
DAM
2008
62views more  DAM 2008»
13 years 11 months ago
The edge-diametric theorem in Hamming spaces
The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswed...
Christian Bey