scientific article; zbMATH DE number 1156638

MaRDI QIDQ4390670zbMATH OpenFDO

Authors Mohamed H. El-Zahar, Bayoumi I. Bayoumi, Soheir M. Khamis

Publication date 25 October 2001

zbMATH Keywords

counting algorithmprecedence matrices of posetsunlabeled prime posetsunlabelled UPO graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to ordered structures (06-04) Combinatorics of partially ordered sets (06A07) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Ulam numbers of graphs
• Graph-based counting theory and its applications
• An algebraic representation of graphs and applications to graph enumeration
• New results from an algorithm for counting posets
• Graph operations and upper bounds on graph homomorphism counts
• Counting graph homomorphisms
• The complexity of counting poset and permutation patterns
• scientific article; zbMATH DE number 1545676
• Constructive enumeration of graphs
• Counting finite posets and topologies

Cited in

(8)

• New results from an algorithm for counting posets
• Height counting of unlabeled interval and \(N\)-free posets.
• Exact counting of unlabeled rigid interval posets regarding or disregarding height
• Recognition of prime posets and one of its applications
• On numerical counting of prime, UPO, and the general type of posets according to heights
• An exact enumeration of the unlabeled disconnected posets
• Efficiently counting representations of finite posets
• Orderly algorithm to enumerate central groupoids and their graphs

This page was built for publication:

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