The following pages link to Peter Tittmann (Q426769):
Displaying 30 items.
- Domination reliability (Q426770) (← links)
- Recurrence relations and splitting formulas for the domination polynomial (Q456395) (← links)
- Counting connected set partitions of graphs (Q625376) (← links)
- (Q966029) (redirect page) (← links)
- Bonferroni-type inequalities and binomially bounded functions (Q966030) (← links)
- Partitions and network reliability (Q1302179) (← links)
- Neighborhood and domination polynomials of graphs (Q1756089) (← links)
- Bonferroni-Galambos inequalities for partition lattices (Q1773163) (← links)
- Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\) (Q1977368) (← links)
- Subset-sum representations of domination polynomials (Q2014717) (← links)
- Bipartition polynomials, the Ising model, and domination in graphs (Q2344022) (← links)
- Graph operations and neighborhood polynomials (Q2656325) (← links)
- (Q2769108) (← links)
- Einführung in die Kombinatorik (Q2922140) (← links)
- (Q2971224) (← links)
- Reliability and Maintenance (Q3102232) (← links)
- A combined decomposition-reduction approach to the <i>K</i>-terminal reliability of. stochastic networks (Q3204305) (← links)
- Improved Bonferroni Inequalities and Binomially Bounded Functions (Q3439569) (← links)
- (Q3980382) (← links)
- A generalized reduction method for the connectedness probability of stochastic networks (Q3981141) (← links)
- Eine Zerlegungsformel für die Zuverlässigkeit komplizierter technischer Systeme/ A decomposition formula for determining the reliability of complex technical systems (Q4006372) (← links)
- IEEE Trans. Reliab., (Q4012377) (← links)
- (Q4217112) (← links)
- (Q4449286) (← links)
- A recursive formula for the two‐edge connected and biconnected reliability of a complete graph (Q4638582) (← links)
- (Q4821392) (← links)
- Domination Polynomials of Graph Products (Q4977512) (← links)
- Einführung in die Kombinatorik (Q5376502) (← links)
- A Graph Polynomial Arising from Community Structure (Extended Abstract) (Q5851091) (← links)
- On the activities and partitions of the vertex subsets of graphs (Q6155991) (← links)
