Encoding and enumerating acyclic orientations of graphs

DOI10.61091/UM125-02MaRDI QIDQ6860179zbMATH OpenFDO

Authors Walter Carballosa, Francisco A. Reyes, Jessica Khera

Publication date 10 February 2026

Published in Utilitas Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/UM125-02

zbMATH Keywords

acyclic graphsencoding graphsenumerating graphsmultipartite graphs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Cites work

• A combinatorial interpretation of the poly-Bernoulli numbers and two Fermat analogues
• Acyclic orientations of complete bipartite graphs
• Acyclic orientations of graphs
• Asymptotic enumeration of lonesum matrices
• Combinatorics of poly-Bernoulli numbers
• Generating the Acyclic Orientations of a Graph
• Hard Enumeration Problems in Geometry and Combinatorics
• scientific article; zbMATH DE number 637346 (Why is no real title available?)
• scientific article; zbMATH DE number 1441933 (Why is no real title available?)
• Network reliability and acyclic orientations
• Sparsity. Graphs, structures, and algorithms
• The prism of the acyclic orientation graph is Hamiltonian

This page was built for publication: Encoding and enumerating acyclic orientations of graphs

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