Algorithms for constructing graphs and digraphs with given valences and factors (Q2561241): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The k-factor conjecture is true / rank | |||
Normal rank | |||
Latest revision as of 12:04, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for constructing graphs and digraphs with given valences and factors |
scientific article |
Statements
Algorithms for constructing graphs and digraphs with given valences and factors (English)
0 references
1973
0 references
