Imrich, Wilfried - Department für Mathematik und Informationstechnologie, Montanuniversität Leoben

• Fast recognition algorithms for classes of partial cubes Bostjan Bresar
• Recognizing Hamming graphs in O(m) time and Wilfried Imrich
• Factoring Cardinal Product Graphs in Polynomial Time
• FACTORING CARTESIAN-PRODUCT GRAPHS Wilfried Imrich
• Tiled partial cubes Bostjan Bresar
• Recognizing median graphs in subquadratic time Johann Hagauer
• Recognizing halved cubes in a constant time per Wilfried Imrich
• Math. Proc. Camb. Phil.Soc. (1989), lO5,421 Printed, in Great Britain
• Also available on http://amc.imfm.si ARS MATHEMATICA CONTEMPORANEA x (xxxx) 1x
• Fixed subsets of homomorphisms of free groups Institut fur Mathematik und Angewandte Geometrie
• Factoring Directed Graphs with respect to the Cardinal Product in Polynomial Time
• Classification of tensor products of symmetric Department of Mathematics and Applied Geometry
• The characterization of trivalent graphs with minimal eigenvalue gap
• Mh. Math. 87,273-280 (lg7g) Onthe Numberof Subgroupsof GivenInilex in the
• comput complexity 2 (1992),331 349 CAFUTESIAN GRAPH
• GEODESICS IN TRANSITIVE GRAPHS C. Paul Bonnington1
• Distinguishing infinite graphs Wilfried Imrich
• Recognizing graphs of acyclic cubical complexes Wilfried Imrich
• I Cartesian Products 1 1 The Cartesian Product 3
• Factoring Directed Graphs with respect to the Cardinal Product in Polynomial Time II
• Local algorithms for the prime factorization of strong product graphs
• Approximate Graph Products Marc Hellmutha
• Cancellation properties of products of graphs Wilfried Imricha
• Recognizing Cartesian Products in Linear Time Wilfried Imrich
• Fast recognition of classes of almost-median graphs Wilfried Imrich
• Finite and Infinite Hypercubes as Direct Products Wilfried Imrich
• A Prime Factor Theorem for a Generalized Direct Product
• Reconstructing subgraph-counting graph polynomials of increasing families of graphs 1
• Hypercubes as direct products Bostjan Bresar
• Tree-like isometric subgraphs of hypercubes Bostjan Bresar
• Reconstructing subgraph-counting graph polynomials Bostjan Bresar
• Minimum Cycle Bases of Product Graphs Wilfried Imricha,1
• RUNNING TITLE: STRONG PRODUCT OF k-EXTENDABLE AND l-EXTENDABLE GRAPHS
• Median graphs and triangle-free graphs Wilfried Imrich
• A Convexity Lemma and Expansion Procedures for Bipartite Graphs
• A characterization of halved cubes Wilfried Imrich
• SEPARATING DOUBLE RAYS IN LOCALLY FINITE PLANAR GRAPHS
• On Howson's Theorem Wilfried Imrich
• Retracts of strong products of graphs Institut fur Mathematik und Angewandte Geometrie
• Reprintedfrom Israel Journal of Mathematics
• ON THE WEAK RECONSTRUCTION OF CARTESIAN-PRODUCT GRAPHS
• On the complexity of recognizing Hamming graphs and related classes of graphs
• THE AVERAGE SIZE OF NONSINGULAR SETS IN A GRAPH Wilfried IMRICH1
• A NOTE ON BOUNDED AUTOMORPHISMS OF INFINITE GRAPHS
• Distinguishing Cartesian powers of graphs Wilfried Imrich
• The distinguishing number of Cartesian products of complete graphs
• Studies of the University of Zilina Mathematical Series
• Multiple Kronecker Covering Graphs Wilfried Imrich
• A simple O(mn) algorithm for recognizing Hamming graphs
• RECOGNIZING CARTESIAN GRAPH BUNDLES Wilfried Imrich
• A theorem on integer flows on Cartesian products of graphs