Connectedness of graphs generated by a random <i>d</i>-process (Q4534463): Difference between revisions
From MaRDI portal
Changed an 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: Differential equations for random processes and random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) / rank | |||
Normal rank | |||
Latest revision as of 09:27, 4 June 2024
scientific article; zbMATH DE number 1751582
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectedness of graphs generated by a random <i>d</i>-process |
scientific article; zbMATH DE number 1751582 |
Statements
Connectedness of graphs generated by a random <i>d</i>-process (English)
0 references
17 November 2002
0 references
graph process
0 references
