Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Gottfried
Last name:	Tinhofer
DBLP:	34/4978
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 13  

Select a publication
Show	Title	Venue	Rating	Date
	Mikhail E. Muzychuk, Gottfried Tinhofer. Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes.	Electr. J. Comb. 2001, Volume 8	(0)	2001
	Sergei Evdokimov, Ilia N. Ponomarenko, Gottfried Tinhofer. Forestal algebras and algebraic forests (on a new class of weakly compact graphs).	Discrete Mathematics 2000, Volume 225	(0)	2000
	Mikhail E. Muzychuk, Gottfried Tinhofer. Recognizing Circulant Graphs of Prime Order in Polynomial Time.	Electr. J. Comb. 1998, Volume 5	(0)	1998
	Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer. The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs.	J. Algorithms 1996, Volume 21	(0)	1996
	Winfried Hochstättler, Gottfried Tinhofer. Hamiltonicity in Graphs with Few P4's.	Computing 1995, Volume 54	(0)	1995
	Gottfried Tinhofer. Bin-packing and Matchings in Threshold Graphs.	Discrete Applied Mathematics 1995, Volume 62	(0)	1995
	Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer. Direct Path Graph Isomorphism (Extended Abstract).	Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings 1995	(0)	1994
	Luitpold Babel, Gottfried Tinhofer. Hard-to-color Graphs for Connected Sequential Colorings.	Discrete Applied Mathematics 1994, Volume 51	(0)	1994
	Gottfried Tinhofer. A note on compact graphs.	Discrete Applied Mathematics 1991, Volume 30	(0)	1991
	Gottfried Tinhofer. Strong tree-cographs are birkhoff graphs.	Discrete Applied Mathematics 1989, Volume 22	(0)	1989

Your query returned 13 matches in the database.