3-Connected Cores In Random Planar Graphs (Q2998851): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Asymptotic enumeration and limit laws of planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Boltzmann Samplers for the Random Generation of Combinatorial Structures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting labelled three-connected and homeomorphically irreducible two- connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random planar graphs / rank | |||
Normal rank | |||
Revision as of 01:39, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 3-Connected Cores In Random Planar Graphs |
scientific article |
Statements
3-Connected Cores In Random Planar Graphs (English)
0 references
11 May 2011
0 references
large random planar graphs
0 references
labelled biconnected graphs
0 references
0 references
