Sciweavers

DM
2008
82views more  DM 2008»
13 years 11 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon
DM
2008
46views more  DM 2008»
13 years 11 months ago
Steiner centers and Steiner medians of graphs
Hong-Gwa Yeh, Chun-Ying Chiang, Sheng-Hueng Peng
DM
2008
59views more  DM 2008»
13 years 11 months ago
On friendly index sets of 2-regular graphs
Harris Kwong, Sin-Min Lee, Ho Kuen Ng
DM
2008
69views more  DM 2008»
13 years 11 months ago
The signed-graphic representations of wheels and whirls
We characterize all of the ways to represent the wheel matroids and whirl matroids using frame matroids of signed graphs. The characterization of wheels is in terms of topological...
Daniel C. Slilaty, Hongxun Qin
DM
2008
96views more  DM 2008»
13 years 11 months ago
Generating 3-vertex connected spanning subgraphs
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
Endre Boros, Konrad Borys, Vladimir Gurvich, G&aac...
DM
2008
51views more  DM 2008»
13 years 11 months ago
On embeddings of snarks in the torus
Andrej Vodopivec
DM
2008
66views more  DM 2008»
13 years 11 months ago
The Monochromatic Column problem
Let p1, p2,..., pn be a sequence of n pairwise coprime positive integers, and let P = p1p2...pn. Let 0, 1, ...,m - 1 be a sequence of m different colors. Let A be an n
Ashish K. Srivastava, Steve Szabo
DM
2008
103views more  DM 2008»
13 years 11 months ago
Edge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
Maria Axenovich, Perry Iverson