111 research outputs found
Spherical tilings by congruent quadrangles : forbidden cases and substructures
In this article we show the non-existence of a class of spherical tilings by congruent quadrangles. We also prove several forbidden substructures for spherical tilings by congruent quadrangles. These are results that will help to complete of the classification of spherical tilings by congruent quadrangles
Types of triangle in plane Hamiltonian triangulations and applications to domination and k-walks
We investigate the minimum number t(0)(G) of faces in a Hamiltonian triangulation G so that any Hamiltonian cycle C of G has at least t(0)(G) faces that do not contain an edge of C. We prove upper and lower bounds on the maximum of these numbers for all triangulations with a fixed number of facial triangles. Such triangles play an important role when Hamiltonian cycles in triangulations with 3-cuts are constructed from smaller Hamiltonian cycles of 4-connected subgraphs. We also present results linking the number of these triangles to the length of 3-walks in a class of triangulation and to the domination number
Construction of planar 4-connected triangulations
In this article we describe a recursive structure for the class of 4-connected triangulations or - equivalently - cyclically 4-connected plane cubic graphs
Automated conjecturing III : property-relations conjectures
Discovery in mathematics is a prototypical intelligent behavior, and an early and continuing goal of artificial intelligence research. We present a heuristic for producing mathematical conjectures of a certain typical form and demonstrate its utility. Our program conjectures relations that hold between properties of objects (property-relation conjectures). These objects can be of a wide variety of types. The statements are true for all objects known to the program, and are the simplest statements which are true of all these objects. The examples here include new conjectures for the hamiltonicity of a graph, a well-studied property of graphs. While our motivation and experiments have been to produce mathematical conjectures-and to contribute to mathematical research-other kinds of interesting property-relation conjectures can be imagined, and this research may be more generally applicable to the development of intelligent machinery
Generation of local symmetry-preserving operations on polyhedra
We introduce a new practical and more general definition of local symmetry-preserving operations on polyhedra. These can be applied to arbitrary embedded graphs and result in embedded graphs with the same or higher symmetry. With some additional properties we can restrict the connectivity, e.g. when we only want to consider polyhedra. Using some base structures and a list of 10 extensions, we can generate all possible local symmetry-preserving operations isomorph-free
Local orientation-preserving symmetry preserving operations on polyhedra
Unifying approaches by amongst others Archimedes, Kepler, Goldberg, Caspar
and Klug, Coxeter, and Conway, and extending on a previous formalisation of the
concept of local symmetry preserving (lsp) operations, we introduce a formal
definition of local operations on plane graphs that preserve
orientation-preserving symmetries, but not necessarily orientation-reversing
symmetries. This operations include, e.g., the chiral Goldberg and Conway
operations as well as all lsp operations. We prove the soundness of our
definition as well as introduce an invariant which can be used to
systematically construct all such operations. We also show sufficient
conditions for an operation to preserve the connectedness of the plane graph to
which it is applied
Alternating plane graphs
A plane graph is called alternating if all adjacent vertices have different degrees, and all neighboring faces as well. Alternating plane graphs were introduced in 2008. This paper presents the previous research on alternating plane graphs.
There are two smallest alternating plane graphs, having 17 vertices and 17 faces each. There is no alternating plane graph with 18 vertices, but alternating plane graphs exist for all cardinalities from 19 on. From a small set of initial building blocks, alternating plane graphs can be constructed for all large cardinalities. Many of the small alternating plane graphs have been found with extensive computer help.
Theoretical results on alternating plane graphs are included where all degrees have to be from the set {3,4,5}. In addition, several classes of “weak alternating plane graphs” (with vertices of degree 2) are presented
- …