A formula for the number of labeled connected graphs

MaRDI QIDQ5263780zbMATH OpenFDO

Authors

Publication date 17 July 2015

Full work available at URL http://mathnet.ru/eng/da696

zbMATH Keywords

blockenumerationconnected graphcactusouter-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Enumeration of labeled connected graphs with given order and size
• The enumeration of labeled graphs by number of cutpoints
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• The number of labeled outerplanar k-cyclic graphs
• On the number of labeled outerplanar k-cyclic bridgeless graphs

Cited in

(10)

• On one approach to enumeration of labeled connected graphs: a review
• Enumeration of labeled outerplanar bicyclic and tricyclic graphs
• The second Riddell relation and its consequences
• The number of labeled outerplanar k-cyclic graphs
• Enumeration of labeled geodetic planar graphs
• Enumeration of labeled Eulerian 3-cacti
• Enumeration of labeled bi-block graphs
• Enumeration of labeled block-cactus graphs
• Enumeration of labeled connected graphs with given order and size
• Catalan number and enumeration of maximal outerplanar graphs

This page was built for publication: A formula for the number of labeled connected graphs

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