Enumeration of unlabelled bicolored graphs by degree parities

DOI10.1016/S0378-3758(96)00070-5zbMATH Open0878.05047MaRDI QIDQ1361672FDOQ1361672

Teruhiro Shirakura, Shinsei Tazawa

Publication date: 18 December 1997

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

Recommendations

• scientific article; zbMATH DE number 530033
• Enumeration of unlabelled graphs with specified degree parities
• scientific article; zbMATH DE number 1080074
• scientific article; zbMATH DE number 597551

zbMATH Keywords

enumerationunlabelled bicolored graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the strength of connectedness of a random graph
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration and Representation of Nonisomorphic Bipartite Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree
• Title not available (Why is that?)
• Enumeration of labelled multigraphs by degree parities
• Enumeration of Graphs with Given Partition
• Euler Graphs on Labelled Nodes

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration of connected graphs with cut vertices
• Enumeration of unlabeled uniform hypergraphs

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

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