A minimum-vertex triangulation (Q1219296): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5572939 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4773723 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann / rank | |||
Normal rank |
Latest revision as of 17:09, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A minimum-vertex triangulation |
scientific article |
Statements
A minimum-vertex triangulation (English)
0 references
1978
0 references
0 references