Sciweavers

Share
COMBINATORICA
2011
7 years 10 months ago
On planarity of compact, locally connected, metric spaces
Thomassen [Combinatorica 24 (2004), 699–718] proved that a 2–connected, compact, locally connected metric space is homeomorphic to a subset of the sphere if and only if it doe...
R. Bruce Richter, Brendan Rooney, Carsten Thomasse...
JCT
2010
135views more  JCT 2010»
8 years 8 months ago
Countable connected-homogeneous graphs
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
Robert Gray, D. Macpherson
EJC
2002
8 years 10 months ago
Cycle Cover Ratio of Regular Matroids
A cycle in a matroid is a disjoint union of circuits. This paper proves that every regular matroid M without coloops has a set S of cycles whose union is E(M) such that every elem...
Hong-Jian Lai, Hoifung Poon
TCS
2008
8 years 10 months ago
Swept regions and surfaces: Modeling and volumetric properties
We consider "swept regions" and "swept hypersurfaces"B in Rn+1 (and especially R3) which are a disjoint union of subspaces t = t or Bt = Bt obtained from a va...
James N. Damon
CORR
2007
Springer
76views Education» more  CORR 2007»
8 years 10 months ago
Optimizing diversity
We consider the problem of minimizing the size of a set system G such that every subset of {1, . . . , n} can be written as a disjoint union of at most k members of G, where k and...
Yannick Frein, Benjamin Lévêque, Andr...
RTA
1991
Springer
9 years 1 months ago
Completeness of Combinations of Constructor Systems
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
Aart Middeldorp, Yoshihito Toyama
RTA
1997
Springer
9 years 2 months ago
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders
Series-parallel orders are de ned as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive de nition,...
Denis Béchet, Philippe de Groote, Christian...
WG
2001
Springer
9 years 2 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...
CADE
2003
Springer
9 years 10 months ago
Canonization for Disjoint Unions of Theories
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
Sava Krstic, Sylvain Conchon
books