Orderly algorithms for generating restricted classes of graphs

DOI10.1002/jgt.3190030210zbMath0404.05051OpenAlexW1966150318WikidataQ99232279 ScholiaQ99232279MaRDI QIDQ4189318

Ronald C. Read, Charles J. Colbourn

Publication date: 1979

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190030210

zbMATH Keywords

GenerationCatalogsRestricted Classes of Graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

Pruning the search tree in the constructive enumeration of molecular graphs ⋮ There are 3155 nonisomorphic perfect one‐factorizations of K₁₆ ⋮ New results from an algorithm for counting posets