On the structure of the Steiner triple systems derived from the Steiner quadruple systems
Charles C. Lindner (1975)
Colloquium Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Pedals, autoroulettes and Steiner's theorem.”
On the structure of the Steiner triple systems derived from the Steiner quadruple systems
Some remarks on the Steiner triple systems associated with Steiner quadruple systems
Charles C. Lindner (1975)
Colloquium Mathematicae
Similarity:
Partial parallel classes in Steiner systems
Mario Gionfriddo (1989)
Colloquium Mathematicae
Similarity:
Some remarks on the number of different triple systems of Steiner
B. Rokowska (1971)
Colloquium Mathematicae
Similarity:
Simple counter examples for the unsolvability of the Fermat- and Steiner-Weber-problem by compass and ruler.
Mehlhos, St. (2000)
Beiträge zur Algebra und Geometrie
Similarity:
On the number of non-isomorphic Steiner triples
Barbara Rokowska (1973)
Colloquium Mathematicae
Similarity:
On the construction of non-isomorphic Steiner quadruple systems
Charles C. Lindner (1974)
Colloquium Mathematicae
Similarity:
Non-isomorphic Steiner triples with subsystems
B. Rokowska (1977)
Colloquium Mathematicae
Similarity:
The forcing steiner number of a graph
A.P. Santhakumaran, J. John (2011)
Discussiones Mathematicae Graph Theory
Similarity:
For a connected graph G = (V,E), a set W ⊆ V is called a Steiner set of G if every vertex of G is contained in a Steiner W-tree of G. The Steiner number s(G) of G is the minimum cardinality of its Steiner sets and any Steiner set of cardinality s(G) is a minimum Steiner set of G. For a minimum Steiner set W of G, a subset T ⊆ W is called a forcing subset for W if W is the unique minimum Steiner set containing T. A forcing subset for W of minimum cardinality is a minimum forcing subset...
The Steiner Ratio Conjecture for Cocircular Points.
J.H. Rubinstein, D.A. Thomas (1992)
Discrete & computational geometry
Similarity:
Steiner Minimal Trees on Sets of Four Points.
D.Z. Du, F.K. Hwang, G.D. Song, G.Y Ting (1987)
Discrete & computational geometry
Similarity:
Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.
M. Yvinec (1992)
Discrete & computational geometry
Similarity:
A Décomposition Theorem on Euclidean Steiner Minimal Trees.
D.Z. Du, F.K. Hwang, G.D. Song, G.Y Ting (1988)
Discrete & computational geometry
Similarity:
On the forcing geodetic and forcing steiner numbers of a graph
A.P. Santhakumaran, J. John (2011)
Discussiones Mathematicae Graph Theory
Similarity:
For a connected graph G = (V,E), a set W ⊆ V is called a Steiner set of G if every vertex of G is contained in a Steiner W-tree of G. The Steiner number s(G) of G is the minimum cardinality of its Steiner sets and any Steiner set of cardinality s(G) is a minimum Steiner set of G. For a minimum Steiner set W of G, a subset T ⊆ W is called a forcing subset for W if W is the unique minimum Steiner set containing T. A forcing subset for W of minimum cardinality is a minimum forcing subset...
On the Number of Minimal 1-Steiner Trees.
B. Aronov, D. Eppstein, M. Bern (1994)
Discrete & computational geometry
Similarity:
Stability of the Steiner symmetrization of convex sets
Marco Barchiesi, Filippo Cagnetti, Nicola Fusco (2013)
Journal of the European Mathematical Society
Similarity:
The isoperimetric inequality for Steiner symmetrization of any codimension is investigated and the equality cases are characterized. Moreover, a quantitative version of this inequality is proven for convex sets.