Minimally 3-connected isotropic systems (Q1340133)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 700947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimally 3-connected isotropic systems |
scientific article; zbMATH DE number 700947 |
Statements
Minimally 3-connected isotropic systems (English)
0 references
3 May 1995
0 references
Isotropic systems are structures which unify some properties of 4-regular graphs and self-dual properties of binary matroids, such as connectivity and minors. In this paper, the minimally 3-connected isotropic systems are found; they are exactly the cyclic isotropic systems (Lemma 4.2 and Theorem 4.3). The author shows also that such a system \(S = (L,V)\) is bipartite if and only if the number of vertices, \(| V |\), is even. An application to prime graphs is given at the end of the paper.
0 references
4-regular graphs
0 references
binary matroids
0 references
connectivity
0 references
minors
0 references
isotropic systems
0 references
prime graphs
0 references
0.836054801940918
0 references
0.8320083618164062
0 references
0.7692603468894958
0 references
