Hanns-Martin Teichert

According to our database, Hanns-Martin Teichert authored at least 22 papers between 1981 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

Niche hypergraphs of products of digraphs.

Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2020

2016

Product of digraphs and their competition graphs.

Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2016

Niche hypergraphs.

Christian Garske, Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2016

2015

Some Results on Exclusive Sum Labelings of Hypergraphs.

Martin Sonntag, Hanns-Martin Teichert

Graphs Comb., 2015

2013

Neighborhood structures and products of undirected graphs.

Martin Sonntag, Hanns-Martin Teichert

Discret. Math., 2013

2012

Iterated neighborhood graphs.

Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2012

2010

Structural Properties and Hamiltonicity of Neighborhood Graphs.

Ingo Schiermeyer, Martin Sonntag, Hanns-Martin Teichert

Graphs Comb., 2010

2009

Competition Hypergraphs of Products of Digraphs.

Martin Sonntag, Hanns-Martin Teichert

Graphs Comb., 2009

2008

Competition hypergraphs of digraphs with certain properties II. Hamiltonicity.

Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2008

Competition hypergraphs of digraphs with certain properties I. Strong connectedness.

Martin Sonntag, Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2008

2004

Competition hypergraphs.

Martin Sonntag, Hanns-Martin Teichert

Discret. Appl. Math., 2004

2001

On the sum number and integral sum number of hypertrees and complete hypergraphs.

Martin Sonntag, Hanns-Martin Teichert

Discret. Math., 2001

2000

Sum labellings of cycle hypergraphs.

Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2000

Classes of hypergraphs with sum number one.

Hanns-Martin Teichert

Discuss. Math. Graph Theory, 2000

Sum numbers of hypertrees.

Martin Sonntag, Hanns-Martin Teichert

Discret. Math., 2000

1999

The sum number of d-partite complete hypergraphs.

Hanns-Martin Teichert

Discuss. Math. Graph Theory, 1999

1983

Connectivity and Hamiltonian Properties of the Disjunction of Undirected Graphs.

Hanns-Martin Teichert

J. Inf. Process. Cybern., 1983

On the Pancyclicity of Some Product Graphs.

Hanns-Martin Teichert

J. Inf. Process. Cybern., 1983

Hamiltonian Properties of the Lexicographic Product of Undirected Graphs.

Hanns-Martin Teichert

J. Inf. Process. Cybern., 1983

1982

On the Cartesian Sum of Undirected Graphs.

Hanns-Martin Teichert

J. Inf. Process. Cybern., 1982

Über B-Produkte mit einelementiger Basismenge - eine Verallgemeinerung des cartesischen Produkts ungerichteter Graphen.

Hanns-Martin Teichert

J. Inf. Process. Cybern., 1982

1981

Über eine Klasse von B-Produkten ungerichteter Graphen.

Hanns-Martin Teichert

J. Inf. Process. Cybern., 1981