#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1981

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

A d-uniform hypergraph H is a sum hypergraph iff there is a finite S ⊆ IN such that H is isomorphic to the hypergraph H+d (S) = (V, E), where V = S and E = {{v1, . . . , vd} : (i 6= j ⇒ vi 6= vj)∧ ∑d i=1 vi ∈ S}. For an arbitrary d-uniform hypergraph H the sum number σ = σ(H) is defined to be the minimum number of isolated vertices w1, . . . , wσ 6∈ V such… (More)

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

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

A hypergraph H is a sum hypergraph i there are a nite S ⊂N+ and dmin ; dmax ∈ N with 1¡dmin6dmax such that H is isomorphic to the hypergraph Hdmin ;dmax (S)=(V;E) where V :=S and E:= { e⊆ S: dmin6|e|6dmax and ∑

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

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

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

- Holger Hennig, Nikolaus Osterrieder, Michael Müller-Steinhardt, Hanns-Martin Teichert, Holger Kirchner, Klaus-Peter Wandinger
- Journal of clinical microbiology
- 2003

Marek's disease virus (MDV) causes a common lymphomatous and neuropathic disease in domestic chickens and, less commonly, turkeys and quail. It is a member of the alpha-herpesviruses and until now was considered to be strongly cell associated. In 1991, MDV was suggested to be the causative infectious agent of multiple sclerosis (MS) in humans. In a previous… (More)

- 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)

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

A hypergraph H is a sum hypergraph iff there are a finite S ⊆ IN and d, d ∈ IN with 1 < d ≤ d such that H is isomorphic to the hypergraph Hd,d(S) = (V, E) where V = S and E = {e ⊆ S : d ≤ |e| ≤ d ∧ ∑ v∈e v ∈ S}. For an arbitrary hypergraph H the sum number σ = σ(H) is defined to be the minimum number of isolated vertices w1, . . . , wσ 6∈ V such that H ∪… (More)

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