The maximum degree of random planar graphs (Q2930131): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Konstantinos D. Panagiotou / rank
Normal rank
 
Property / author
 
Property / author: Konstantinos D. Panagiotou / rank
 
Normal rank
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.1112/plms/pdu024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999514338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of labeled 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Degree Sequence of Random Graphs from Subcritical Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On properties of random dissections and triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boltzmann Samplers, Pólya Theory, and Cycle Pointing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete grammar for decomposing a family of graphs into 3-connected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertices of given degree in series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree distribution in random planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Degree of Series-Parallel 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: Singularity Analysis of Generating Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-Connected Cores In Random Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform random sampling of planar graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of the maximum vertex degree in random planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration and limit laws of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes with given 3-connected components: Asymptotic enumeration and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Degree of a Random Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The enumeration of c-nets via quadrangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal biconnected subgraphs of random planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration, global structure, and constrained evolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:09, 9 July 2024

scientific article
Language Label Description Also known as
English
The maximum degree of random planar graphs
scientific article

    Statements

    The maximum degree of random planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 November 2014
    0 references
    Boltzmann sampling techniques
    0 references
    random labeled planar graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references