Algorithm 28 algorithm for generating graphs of a given partition
- 1 March 1976
- journal article
- Published by Springer Nature in Computing
- Vol. 16 (1) , 153-161
- https://doi.org/10.1007/bf02241986
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Algorithm 29 efficient algorithms for doubly and multiply restricted partitionsComputing, 1976
- THE PRODUCTION OF GRAPHS BY COMPUTERPublished by Elsevier ,1972
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Enumeration of Graphs with Given PartitionCanadian Journal of Mathematics, 1968
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. IJournal of the Society for Industrial and Applied Mathematics, 1962
- The number of linear, directed, rooted, and connected graphsTransactions of the American Mathematical Society, 1955