The number of connected sparsely edged graphs. II. Smooth graphs and blocks (Q4143336): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/jgt.3190020403 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2056914622 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:20, 19 March 2024
scientific article; zbMATH DE number 3572203
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of connected sparsely edged graphs. II. Smooth graphs and blocks |
scientific article; zbMATH DE number 3572203 |
Statements
The number of connected sparsely edged graphs. II. Smooth graphs and blocks (English)
0 references
1978
0 references
NUMBER OF CONNECTED SPARSELY EDGED GRAPHS
0 references
SMOOTH GRAPHS
0 references
BLOCKS
0 references