#### Filter Results:

#### Publication Year

1981

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Martin Sonntag, Hanns-Martin Teichert
- Discrete Applied Mathematics
- 2004

- Martin Sonntag, Hanns-Martin Teichert
- Discrete Mathematics
- 2001

- Hanns-Martin Teichert
- Discussiones Mathematicae Graph Theory
- 1999

A d-uniform hypergraph H is a sum hypergraph iff there is a finite

- Hanns-Martin Teichert
- Elektronische Informationsverarbeitung und…
- 1983

- Hanns-Martin Teichert
- Elektronische Informationsverarbeitung und…
- 1982

- Martin Sonntag, Hanns-Martin Teichert
- Discussiones Mathematicae Graph Theory
- 2008

If D = (V, A) is a digraph, its competition hypergraph CH(D) has vertex set V and e ⊆ V is an edge of CH(D) iff |e| ≥ 2 and there is a vertex v ∈ V , such that e = N − D (v) = {w ∈ V |(w, v) ∈ A}. We give characterizations of CH(D) in case of hamiltonian digraphs D and, more general, of digraphs D having a τ-cycle factor. The results are closely related to… (More)

- Ingo Schiermeyer, Martin Sonntag, Hanns-Martin Teichert
- Graphs and Combinatorics
- 2010

Let G = (V, E) be a simple undirected graph. N (G) = (V, E N) is the neighborhood graph of the graph G, if and only if E N = {{a, b} | a = b ∧ ∃ x ∈ V : {x, a} ∈ E ∧ {x, b} ∈ E}. After discussing several structural properties of N (G), e.g. edge numbers and connectivity, we characterize the hamiltonicity of N (G) by means of chords of a hamiltonian cycle in… (More)

- Martin Sonntag, Hanns-Martin Teichert
- Graphs and Combinatorics
- 2009

If D = (V, A) is a digraph, its competition hypergraph CH(D) has vertex set V and e ⊆ V is an edge of CH(D) iff |e| ≥ 2 and there is a vertex v ∈ V , such that e = {w ∈ V |(w, v) ∈ A}. For several products D 1 • D 2 of digraphs D 1 and D 2 , we investigate the relations between the competition hypergraphs of the factors D 1 , D 2 and the competition… (More)

- Martin Sonntag, Hanns-Martin Teichert
- Discussiones Mathematicae Graph Theory
- 2008

If D = (V, A) is a digraph, its competition hypergraph CH(D) has the vertex set V and e ⊆ V is an edge of CH(D) iff |e| ≥ 2 and there is a vertex v ∈ V , such that e = {w ∈ V |(w, v) ∈ A}. We tackle the problem to minimize the number of strong components in D without changing the competition hypergraph CH(D). The results are closely related to the… (More)

- Martin Sonntag, Hanns-Martin Teichert
- Discrete Mathematics
- 2000