Generating regular directed graphs

DOI10.1016/J.DISC.2012.09.014MaRDI QIDQ1759803zbMATH OpenOpenAlexFDO

Authors Gunnar Brinkmann

Publication date 22 November 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.09.014

zbMATH Keywords

bipartitedirected graphcanonical construction pathstructure generation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Generating Random Regular Graphs Quickly
• Uniform generation of random regular graphs of moderate degree
• Fast uniform generation of regular graphs
• Generating random regular graphs
• Fast generation of cubic graphs

Cited in

(7)

• An information-theoretic approach to study spatial dependencies in small datasets
• scientific article; zbMATH DE number 94782 (Why is no real title available?)
• Sometimes hoarding is harder than cleaning: NP-hardness of maximum blocked-clause addition
• Directed strongly walk-regular graphs
• Generating water clusters and other directed graphs
• Enumeration and generation of a class of regular digraphs
• Rock-paper-scissors meets Borromean rings

This page was built for publication: Generating regular directed graphs

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