Algorithm for generating graphs of a given partition
From MaRDI portal
Publication:1223434
DOI10.1007/BF02241986zbMath0321.05143OpenAlexW176728331MaRDI QIDQ1223434
Publication date: 1976
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02241986
Graph theory (05C99) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (5)
Chemistry and discrete mathematics ⋮ Orderly algorithms for graph generation ⋮ Algorithm for deriving the chromatic polynomial of a graph ⋮ Efficient algorithms for doubly and multiply restricted partitions ⋮ Fast algorithms for genegrating integer partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for doubly and multiply restricted partitions
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Enumeration of Graphs with Given Partition
- An Efficient Algorithm for Graph Isomorphism
- The Number of Linear, Directed, Rooted, and Connected Graphs
This page was built for publication: Algorithm for generating graphs of a given partition
