Enumeration of Graphs with Given Partition

DOI10.4153/CJM-1968-005-0MaRDI QIDQ5563933zbMATH OpenFDO

Authors K. R. Parthasarathy

Publication date 1968

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1968-005-0

zbMATH Keywords

topology

Cited in

(9)

• Cataloguing general graphs by point and line spectra
• Graphic sequences with unique realization
• Algorithm for generating graphs of a given partition
• Enumeration of unlabelled bicolored graphs by degree parities
• Split graphs
• Enumeration of unlabeled uniform hypergraphs
• Enumeration of graphs by degree sequence
• A Characterization of Forcibly Tripartite Self-Complementary class of Partitioned Sequences
• Counting the 10-point graphs by partition

This page was built for publication: Enumeration of Graphs with Given Partition

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