Number of triangular packings of a marked graph on a projective plane (Q1814064)
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 5714
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Number of triangular packings of a marked graph on a projective plane |
scientific article; zbMATH DE number 5714 |
Statements
Number of triangular packings of a marked graph on a projective plane (English)
0 references
25 June 1992
0 references
Let \(G(T)\) be the graph of a triangulation \(T\) of the projective plane \(N_ 1\) and \(\tau(G(T),N_ 1)\) be the number of different triangular packings of the graph \(G(T)\) on \(N_ 1\). Exact upper estimates for the number \(\tau(G(T),N_ 1)\) have been obtained depending on the connectedness \(\kappa(G(T))\) of the graph \(G(T)\), all possible values of the connectedness being investigated.
0 references
triangular packings
0 references
projective plane
0 references
connectedness
0 references
0 references
0.9151821
0 references
0.89468455
0 references
0 references
0.88475704
0 references
0.8826805
0 references
0.8783578
0 references
0.8769778
0 references
0.87693864
0 references
0.8695293
0 references
