Peter Tittmann

From MaRDI portal
(Redirected from Person:426769)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Edge contraction and forbidden induced subgraphs2025-11-17Paper
On the activities and partitions of the vertex subsets of graphs
Enumerative Combinatorics and Applications
2023-06-09Paper
Edge Contraction and Line Graphs2022-12-17Paper
Edge Contraction and Forbidden Induced Graphs2022-03-07Paper
Graph operations and neighborhood polynomials
Discussiones Mathematicae Graph Theory
2021-03-11Paper
Introduction to combinatorics2019-05-10Paper
Neighborhood and domination polynomials of graphs
Graphs and Combinatorics
2019-01-11Paper
A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
Networks
2018-04-27Paper
Domination polynomials of graph products
(available as arXiv preprint)
2017-08-16Paper
Rainbow partitions and rainbow polynomial2017-04-04Paper
The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications2017-02-12Paper
Counting Dominating Sets of Graphs2017-01-12Paper
Bipartition polynomials, the Ising model, and domination in graphs
Discussiones Mathematicae Graph Theory
2015-05-11Paper
Einführung in die Kombinatorik2014-10-09Paper
Subset-sum representations of domination polynomials
Graphs and Combinatorics
2014-06-16Paper
Recurrence relations and splitting formulas for the domination polynomial
The Electronic Journal of Combinatorics
2012-10-24Paper
Recurrence relations and splitting formulas for the domination polynomial
The Electronic Journal of Combinatorics
2012-10-24Paper
Domination reliability
The Electronic Journal of Combinatorics
2012-06-12Paper
Domination reliability
The Electronic Journal of Combinatorics
2012-06-12Paper
Reliability and Maintenance2011-12-02Paper
Counting connected set partitions of graphs
The Electronic Journal of Combinatorics
2011-02-17Paper
Counting connected set partitions of graphs
The Electronic Journal of Combinatorics
2011-02-17Paper
Random Information Spread in Networks2010-08-12Paper
Bonferroni-type inequalities and binomially bounded functions
Discrete Mathematics
2010-04-27Paper
A graph polynomial arising from community structure (extended abstract)
Graph-Theoretic Concepts in Computer Science
2010-01-21Paper
Improved Bonferroni Inequalities and Binomially Bounded Functions
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Bonferroni-Galambos inequalities for partition lattices
The Electronic Journal of Combinatorics
2005-04-25Paper
Bonferroni-Galambos inequalities for partition lattices
The Electronic Journal of Combinatorics
2005-04-25Paper
scientific article; zbMATH DE number 2107574 (Why is no real title available?)2004-10-13Paper
scientific article; zbMATH DE number 2038883 (Why is no real title available?)2004-02-08Paper
scientific article; zbMATH DE number 2038883 (Why is no real title available?)2004-02-08Paper
Introduction to combinatorics2002-02-05Paper
Improved upper bounds for self-avoiding walks in Z^d
The Electronic Journal of Combinatorics
2000-05-11Paper
Improved upper bounds for self-avoiding walks in Z^d
The Electronic Journal of Combinatorics
2000-05-11Paper
Partitions and network reliability
Discrete Applied Mathematics
1999-09-22Paper
scientific article; zbMATH DE number 1218897 (Why is no real title available?)1998-11-03Paper
IEEE Trans. Reliab.,
Communications in Statistics. Stochastic Models
1992-09-27Paper
Eine Zerlegungsformel für die Zuverlässigkeit komplizierter technischer Systeme/ A decomposition formula for determining the reliability of complex technical systems
at - Automatisierungstechnik
1992-09-26Paper
scientific article; zbMATH DE number 21369 (Why is no real title available?)1992-06-26Paper
A generalized reduction method for the connectedness probability of stochastic networks
IEEE Transactions on Reliability
1992-06-26Paper
A combined decomposition-reduction approach to the <i>K</i>-terminal reliability of. stochastic networks
Optimization
1990-01-01Paper


Research outcomes over time


This page was built for person: Peter Tittmann