Now showing items 21-25 of 25

  • Random cubic planar graphs revisited 

    Noy Serrano, Marcos; Requile, Clement; Rué Perna, Juan José (2016-10-18)
    Article
    Open Access
    The goal of our work is to analyze random cubic planar graphs according to the uniform distribution. More precisely, let G be the class of labelled cubic planar graphs and let gn be the number of graphs with n vertices
  • Random cubic planar graphs revisited 

    Rué Perna, Juan José; Noy Serrano, Marcos; Requile, Clement (Elsevier, 2016)
    Other
    Restricted access - publisher's policy
    The goal of our work is to analyze random cubic planar graphs according to the uniform distribution. More precisely, let G be the class of labelled cubic planar graphs and let gn be the number of graphs with n vertices. ...
  • Random planar maps and graphs with minimum degree two and three 

    Noy Serrano, Marcos; Ramos, Lander (2018-10-05)
    Article
    Open Access
    We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest ...
  • The Maximum degree of series-parallel graphs 

    Drmota, Michael; Giménez Llach, Omer; Noy Serrano, Marcos (2011-07)
    Article
    Restricted access - confidentiality agreement
    We prove that the maximum degree Δn of a random series-parallel graph with n vertices satisfies Δn/ log n → c in probability, and EΔn ∼ c log n for a computable constant c > 0. The same kind of result holds for 2-connected ...
  • The Tutte polynomial characterizes simple outerplanar graphs 

    Goodall, Andrew; Mier Vinué, Anna de; Noble, S.; Noy Serrano, Marcos (2011-07)
    Article
    Restricted access - confidentiality agreement
    We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar. Examples show that the condition of G being simple cannot be omitted.