On the complexity of a hypermap (Q1173096): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(82)90219-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1972387457 / rank | |||
Normal rank |
Latest revision as of 09:23, 30 July 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