Enumeration of Graphs with Given Partition

From MaRDI portal

Revision as of 03:38, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5563933

Jump to:navigation, search

DOI10.4153/CJM-1968-005-0zbMath0175.20901MaRDI QIDQ5563933

K. R. Parthasarathy

Publication date: 1968

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

zbMATH Keywords

Related Items (9)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5563933&oldid=30180595"