Peter Tittmann

Available identifiers

zbMath Open tittmann.peterMaRDI QIDQ426769

List of research outcomes

Publication	Date of Publication	Type
On the activities and partitions of the vertex subsets of graphs	2023-06-09	Paper
Edge Contraction and Line Graphs	2022-12-17	Paper
Edge Contraction and Forbidden Induced Graphs	2022-03-07	Paper
Graph operations and neighborhood polynomials	2021-03-11	Paper
Einführung in die Kombinatorik	2019-05-10	Paper
Neighborhood and domination polynomials of graphs	2019-01-11	Paper
A recursive formula for the two‐edge connected and biconnected reliability of a complete graph	2018-04-27	Paper
Domination Polynomials of Graph Products	2017-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q2971224	2017-04-04	Paper
The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications	2017-02-12	Paper
Counting Dominating Sets of Graphs	2017-01-12	Paper
Bipartition polynomials, the Ising model, and domination in graphs	2015-05-11	Paper
Einführung in die Kombinatorik	2014-10-09	Paper
Subset-sum representations of domination polynomials	2014-06-16	Paper
Recurrence relations and splitting formulas for the domination polynomial	2012-10-24	Paper
Domination reliability	2012-06-12	Paper
Reliability and Maintenance	2011-12-02	Paper
Counting connected set partitions of graphs	2011-02-17	Paper
Random Information Spread in Networks	2010-08-12	Paper
Bonferroni-type inequalities and binomially bounded functions	2010-04-27	Paper
A graph polynomial arising from community structure (extended abstract)	2010-01-21	Paper
Improved Bonferroni Inequalities and Binomially Bounded Functions	2007-05-29	Paper
Bonferroni-Galambos inequalities for partition lattices	2005-04-25	Paper
https://portal.mardi4nfdi.de/entity/Q4821392	2004-10-13	Paper
https://portal.mardi4nfdi.de/entity/Q4449286	2004-02-08	Paper
Introduction to combinatorics	2002-02-05	Paper
Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)	2000-05-11	Paper
Partitions and network reliability	1999-09-22	Paper
https://portal.mardi4nfdi.de/entity/Q4217112	1998-11-03	Paper
IEEE Trans. Reliab.,	1992-09-27	Paper
Eine Zerlegungsformel für die Zuverlässigkeit komplizierter technischer Systeme/ A decomposition formula for determining the reliability of complex technical systems	1992-09-26	Paper
https://portal.mardi4nfdi.de/entity/Q3980382	1992-06-26	Paper
A generalized reduction method for the connectedness probability of stochastic networks	1992-06-26	Paper
A combined decomposition-reduction approach to the K-terminal reliability of. stochastic networks	1990-01-01	Paper

Research outcomes over time

This page was built for person: Peter Tittmann