We stand with Ukraine  

Hanns-Martin Teichert

According to our database1, Hanns-Martin Teichert authored at least 23 papers between 1981 and 2024.

Collaborative distances:

Timeline

1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
1
1
2
1
1
1
1
1
2
1
1
3
1
3
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Edge intersection hypergraphs.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Discuss. Math. Graph Theory, 2024

2020
Niche hypergraphs of products of digraphs.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Discuss. Math. Graph Theory, 2020

2016
Product of digraphs and their competition graphs.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Discuss. Math. Graph Theory, 2016

Niche hypergraphs.
[BibTeX]
[DOI]
Christian Garske
,
Martin Sonntag
,
Hanns-Martin Teichert
Discuss. Math. Graph Theory, 2016

2015
Some Results on Exclusive Sum Labelings of Hypergraphs.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Graphs Comb., 2015

2013
Neighborhood structures and products of undirected graphs.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Discret. Math., 2013

2012
Iterated neighborhood graphs.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Discuss. Math. Graph Theory, 2012

2010
Structural Properties and Hamiltonicity of Neighborhood Graphs.
[BibTeX]
[DOI]
Ingo Schiermeyer
,
Martin Sonntag
,
Hanns-Martin Teichert
Graphs Comb., 2010

2009
Competition Hypergraphs of Products of Digraphs.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Graphs Comb., 2009

2008
Competition hypergraphs of digraphs with certain properties II. Hamiltonicity.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Discuss. Math. Graph Theory, 2008

Competition hypergraphs of digraphs with certain properties I. Strong connectedness.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Discuss. Math. Graph Theory, 2008

2004
Competition hypergraphs.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Discret. Appl. Math., 2004

2001
On the sum number and integral sum number of hypertrees and complete hypergraphs.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Discret. Math., 2001

2000
Sum labellings of cycle hypergraphs.
[BibTeX]
[DOI]
Hanns-Martin Teichert
Discuss. Math. Graph Theory, 2000

Classes of hypergraphs with sum number one.
[BibTeX]
[DOI]
Hanns-Martin Teichert
Discuss. Math. Graph Theory, 2000

Sum numbers of hypertrees.
[BibTeX]
[DOI]
Martin Sonntag
,
Hanns-Martin Teichert
Discret. Math., 2000

1999
The sum number of d-partite complete hypergraphs.
[BibTeX]
[DOI]
Hanns-Martin Teichert
Discuss. Math. Graph Theory, 1999

1983
Connectivity and Hamiltonian Properties of the Disjunction of Undirected Graphs.
[BibTeX]
Hanns-Martin Teichert
J. Inf. Process. Cybern., 1983

On the Pancyclicity of Some Product Graphs.
[BibTeX]
Hanns-Martin Teichert
J. Inf. Process. Cybern., 1983

Hamiltonian Properties of the Lexicographic Product of Undirected Graphs.
[BibTeX]
Hanns-Martin Teichert
J. Inf. Process. Cybern., 1983

1982
On the Cartesian Sum of Undirected Graphs.
[BibTeX]
Hanns-Martin Teichert
J. Inf. Process. Cybern., 1982

Über B-Produkte mit einelementiger Basismenge - eine Verallgemeinerung des cartesischen Produkts ungerichteter Graphen.
[BibTeX]
Hanns-Martin Teichert
J. Inf. Process. Cybern., 1982

1981
Über eine Klasse von B-Produkten ungerichteter Graphen.
[BibTeX]
Hanns-Martin Teichert
J. Inf. Process. Cybern., 1981


  Loading...