The Order Complexes on the 2-sphere
スポンサーリンク
概要
- 論文の詳細を見る
The following characterizations of the order complexes on the 2-sphere are given. For a poset P, its order complex is a triangulation of the 2-sphere if and only if P is the face poset of a 2-connected plane graph. Furthermore, the following statements are equivalent; (1) The order complex of a poset P is the first barycentric subdivision of a triangulation of the 2-sphere; (2) P is the face poset of a maximal plane graph with at least four vertices; (3) P or the dual P^* is the face poset of a 2-connected cubic graph without multiple edges. Also, the list of the 2-connected plane graphs whose order complexes have at most degree 24 is shown.
- 東海大学の論文
- 1988-03-30
著者
-
Watanabe K
Department Of Mathematical Sciences Tokai University
-
Watanabe Kei-ichi
Department Of Mathematical Sciences Tokai University
-
Narushima Hiroshi
Department Of Information And Network Tokai University Junior College
-
Narushima Hiroshi
Department Of Mathematical Sciences Tokai University
-
Tsuchiya Morimasa
Department of Mathematical Sciences, Tokai University
-
Tsuchiya Morimasa
Department Of Mathematical Sciences Tokai University
-
Tsuchiya Morimasa
Department Of Mathematical Sciences Faculty Of Science Tokai University
関連論文
- Immunolocalization of Glutathione S-transferase in the Rat Uterus
- IMMUNOELECTRON MICROSCOPIC INVESTIGATION OF GLUTATHIONE-PEROXIDASE IN THE RAT STOMACH
- The Number Tables of the Command Flow Numbers on a Boolean Lattice and a Partition Lattice
- A Tag Type Automaton with a Double Reading Head
- A Move Problem on Weighted Digraphs
- Remarks on Relations Between Upper Bound Graphs and Double Bound Graphs
- On double bound graphs whose complements are also double bound graphs
- Order Preserving Maps and Classification of Partially Ordered Sets
- A Class of Recurrence Relations on Acyclic Digraphs of Poset Type (Applied Combinatorial Theory and Algorithms)
- Further Results on Order Maps
- Some Properties of the Distortion Index/Sequence on All MPRsComputational Complexity of Graph Isomorphism Problem(Special Issue on Selected Papers from LA Symposium)
- The Number Table of the Coefficients of the Command Flow Polynomial on a Boolean Lattice
- An Asymptotic Formula for the Number of Chains in a Boolean Lattice : a survey and another proof
- Order Maps and Cardinal Congruence Classes on Partitions
- A Necessary and Sufficient Condition for a Simplicial Complex to be an Order Complex and its Checking Computer Algorithm
- A Proof of Stanley's Characterization for a Simplicial Complex to be an Order Complex
- The Order Complexes on the 2-sphere
- The Lightest Totalization of an Endnode Labelling of a Non-tree Graph II
- Analysis of the Command Flow Numbers I : Boolean Lattices (Graphs and Combinatorics III)
- Filtered Rings, Filtered Blowing-Ups and Normal Two-Dimensional Singularities with "Star-Shaped" Resolution
- MANIFOLD POSETS
- A Note on Contractibility of Posets
- A Survey of Enumerative Combinatorial Theory and A Problem
- Hilbert-Kunz multiplicity of two-dimensional local rings
- Another Proof of Bela Bollobas' Theorem on Edge Disjoint Cycles
- On a Hereditary Poset
- On Regularity of Upper Bound Graphs and Double Bound Graphs
- A Method for Counting the Number of Chains in a Partially Ordered Set
- On Unstable Graphs