Two ``simple 3-spheres

DOI10.1016/0012-365X(87)90169-5zbMath0639.05018MaRDI QIDQ1100212

D. W. Barnette

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cs defined for a graph, representing a large-scale system of nonlinear equations, with specified entrance and exit vertices, in terms of the Menger-type linkings from the entrance to the exit. Some properties of the M-decomposition are shownin particular it is noted that the M-decomposition agrees with the Dulmage-Mendelsohn decomposition of the associated bipartite graph. The M-decomposition is useful for the structural analysis of systems of equations - it leads to the finest block-triangularization and the resulting subproblems are structurally solvable3-dimensional sphere

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Embedding dimensions of simplicial complexes on few vertices, Realization spaces of 4-polytopes are universal, The Slack Realization Space of a Polytope

Cites Work

• On facets with non-arbitrary shapes
• The triangulations of the 3-sphere with up to 8 vertices
• Unnamed Item
• Unnamed Item
• Unnamed Item