Patchworks and metablocks enumeration (Q1607027): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q126843639, #quickstatements; #temporary_batch_1719321775979 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: The number of labeled dissections of a k-ball / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A calculus for the random generation of labelled combinatorial structures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5682013 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The enumeration of labeled graphs by number of cutpoints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The number of connected sparsely edged graphs. II. Smooth graphs and blocks / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126843639 / rank | |||
Normal rank | |||
Latest revision as of 15:25, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Patchworks and metablocks enumeration |
scientific article |
Statements
Patchworks and metablocks enumeration (English)
0 references
25 July 2002
0 references
cutpoint of a graph
0 references
