On the complexity of a hypermap (Q1173096): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4770409 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spanning trees of dual graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4071773 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3206970 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3921249 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of A Planar Hypermap And That of Its Dual / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5578800 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4065567 / rank | |||
Normal rank |
Revision as of 17:46, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of a hypermap |
scientific article |
Statements
On the complexity of a hypermap (English)
0 references
1982
0 references
hypermap
0 references
permutation
0 references
genus
0 references
hypertree
0 references