The enumeration of connected graphs and linked diagrams (Q1132893): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743 |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0097-3165(79)90023-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987867438 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A method and two algorithms on the theory of partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The inversion enumerator for labeled trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a class of linked diagrams. I: Enumeration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5682013 / rank | |||
Normal rank |
Latest revision as of 02:37, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The enumeration of connected graphs and linked diagrams |
scientific article |
Statements
The enumeration of connected graphs and linked diagrams (English)
0 references
1979
0 references
enumeration
0 references
constructive combinatorial proofs
0 references
recurrence formulas
0 references
labeled connected graphs
0 references
linked diagrams
0 references