Enumeration of unlabelled bicolored graphs by degree parities

DOI10.1016/S0378-3758(96)00070-5zbMath0878.05047MaRDI QIDQ1361672

Teruhiro Shirakura, Shinsei Tazawa

Publication date: 18 December 1997

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

enumerationunlabelled bicolored graphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (2)

Enumeration of unlabeled uniform hypergraphs ⋮ Enumeration of connected graphs with cut vertices

Cites Work

• Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree
• Enumeration of labelled multigraphs by degree parities
• A series of search designs for \(2^ m\) factorial designs of resolution V which permit search of one or two unknown extra three-factor interactions
• On the strength of connectedness of a random graph
• Euler Graphs on Labelled Nodes
• Enumeration and Representation of Nonisomorphic Bipartite Graphs
• Enumeration of Graphs with Given Partition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of unlabelled bicolored graphs by degree parities