Enumeration of unlabeled graphs such that both the graph and its complement are 2-connected

MaRDI QIDQ3178889zbMATH OpenFDO

Authors Kumi Kobata, Shinsei Tazawa, Tomoki Yamashita

Publication date 20 December 2016

zbMATH Keywords

enumerationcomplementconnectivity2-connectivity

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 853826
• scientific article; zbMATH DE number 1735656
• The number of labeled 2-connected planar graphs
• scientific article; zbMATH DE number 1424850
• Enumeration of labeled connected bicyclic and tricyclic graphs without bridges

Cited in

(3)

• Validity up to complementation in graph theory
• k-Combinations of an unlabelled graph
• On polyhedral graphs and their complements

This page was built for publication: Enumeration of unlabeled graphs such that both the graph and its complement are 2-connected

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