Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
From MaRDI portal
(Redirected from Publication:1089352)
Recommendations
Cites work
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3710208 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Asymptotic Methods in Enumeration
- Über die Bernoullischen Zahlen und die Eulerschen Polynome
Cited in
(11)- The polytope of degree sequences
- Longest cycles in threshold graphs
- On degree sequences of undirected, directed, and bidirected graphs
- A combinatorial statistic for labeled threshold graphs
- Counting Labeled Threshold Graphs with Eulerian Numbers
- Enumerating threshold graphs and some related graph classes
- Total matchings and total coverings of threshold graphs
- Random walks and hyperplane arrangements
- Enumerative aspects of certain subclasses of perfect graphs
- Enumeration of difference graphs
- Bipartite bithreshold graphs
This page was built for publication: Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089352)