Blocks in constrained random graphs with fixed average degree

MaRDI QIDQ3176612zbMATH OpenFDO

Authors Konstantinos Panagiotou

Publication date 23 July 2018

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAK0161

zbMATH Keywords

generating functionsrandom graphsBoltzmann sampling

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Maximal biconnected subgraphs of random planar graphs
• Maximal biconnected subgraphs of random planar graphs
• On the degree distribution of random planar graphs
• Random graphs from a block-stable class
• 3-Connected Cores In Random Planar Graphs

Cited in

(8)

• Maximal biconnected subgraphs of random planar graphs
• Properties of random graphs via Boltzmann samplers
• Longest and shortest cycles in random planar graphs
• The complexity of the Approximate Multiple Pattern Matching Problem for random strings
• Maximal biconnected subgraphs of random planar graphs
• A proof of the block model threshold conjecture
• Random graphs from a block-stable class
• Expected Maximum Block Size in Critical Random Graphs

This page was built for publication: Blocks in constrained random graphs with fixed average degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176612)