21 citations · 47 across the 8 of their papers we have counts for
8 papers
On the Number of Regular Integers Modulo and Its Significance for Cryptography
Klaus Dohmen, Mandy Lange-Geisler
We present four combinatorial proofs of Morgado's formula for the number of non-congruent regular integers modulo , corresponding to sequence A055653 in the On-Line…
The Orbital Bivariate Chromatic Polynomial
Klaus Dohmen, Mandy Lange-Geisler
We introduce the \emph{orbital bivariate chromatic polynomial}, which counts generalized vertex colorings of a graph up to the action of a group of symmetries. More precisely, adja…
An Abstraction of Whitney's Broken Circuit Theorem
Klaus Dohmen, Martin Trinks
We establish a broad generalization of Whitney's broken circuit theorem on the chromatic polynomial of a graph to sums of type where is a finite set…
Closed-form expansions for the universal edge elimination polynomial
Klaus Dohmen
We establish closed-form expansions for the universal edge elimination polynomial of paths and cycles and their generating functions. This includes closed-form expansions for the b…
Closed-form expansions for the bivariate chromatic polynomial of paths and cycles
Klaus Dohmen
We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or wit…
Domination Reliability
Klaus Dohmen, Peter Tittmann
We propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to th…
Lower Bounds for the Probability of a Union via Chordal Graphs
Klaus Dohmen
We establish new Bonferroni-type lower bounds for the probability of a union of finitely many events where the selection of intersections in the estimates is determined by the cliq…
An Inductive Proof of Whitney's Broken Circuit Theorem
Klaus Dohmen
We present a new proof of Whitney's broken circuit theorem based on induction on the number of edges and the deletion-contraction formula.