Heuristics for graph coloring (2006)
De Werra, D., Tinhofer, G., Mayoraz, E., Noltemeir, H., Syslo, M.
M. Klin, Ch. R Ucker, G. R Ucker, G. Tinhofer, Christoph Rucker, Gerta Rucker, ...
. Let (G; OmegaGamma be a permutation group of degree n. Let V (G; OmegaGamma be the set of all square matrices of order n which commute with all permutation matrices corresponding to permutations...
Graph Set Analysis of Hydrogen Bond Patterns. Some Mathematical Concepts (1999)
Juliana Grell, Joel Bernstein, Gottfried Tinhofer, J. Grell, J. Bernstein, G. Tinhofer
To provide a foundation for further theoretical and software development of the application of graph sets to patterns of hydrogen bonding and other intermolecular interactions a number of...
BEARING TECHNIQUE IN THE NEAR FIELD OF A MAGNETIC TRANSMITTING DIPOLE IN THE VLF REGION. (1998)
From the theory of the radiating magnetic dipole two methods are being derived which permit the location of such a dipole in a dissipative medium (rock). One method is based on the trend of field...
On a New Class of Weakly Compact Graphs (1997)
S. Evdokimov, I. Ponomarenko, G. Tinhofer, Sergei Evdokimov, Gottfried Tinhofer
In this paper we introduce and investigate a new class of graphs called algebraic forests for which isomorphism testing can be done in time O(n 3 log n). The class of algebraic forests admits a...
Hamiltonicity in graphs with few P 4 s (1970)
Winfried Hochstattler, G. Tinhofer, W. Hochstattler
In a recent series of articles R. Jamison and S. Olariu developed, starting from an extension of the notion of a cograph, a theory of the decomposition of graphs into P 4 -connected components. It...
Hamiltonicity in Graphs With Few (1970)
Winfried Hochstattler, G. Tinhofer, W. Hochstattler
Zusammenfassung Hamiltonicity in graphs with few P 4 's. In a recent series of articles R. Jamison and S. Olariu developed, starting from an extension of the notion of a cograph, a theory of the...