The following pages link to Wilfried Imrich (Q201986):
Displaying 50 items.
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- Edge-transitive products (Q295827) (← links)
- Edge-transitive lexicographic and Cartesian products (Q339471) (← links)
- Endomorphism breaking in graphs (Q405090) (← links)
- Infinite graphs with finite 2-distinguishing cost (Q490268) (← links)
- Distinguishing Cartesian products of countable graphs (Q503675) (← links)
- Local algorithms for the prime factorization of strong product graphs (Q626891) (← links)
- Retracts of strong products of graphs (Q686295) (← links)
- A note on bounded automorphisms of infinite graphs (Q750452) (← links)
- Explicit construction of regular graphs without small cycles (Q790830) (← links)
- On optimal embeddings of metrics in graphs (Q794666) (← links)
- Fast recognition of classes of almost-median graphs (Q864135) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- Focality and graph isomorphism (Q913826) (← links)
- Multiple Kronecker covering graphs (Q925013) (← links)
- On the remoteness function in median graphs (Q967439) (← links)
- Approximate graph products (Q1024311) (← links)
- Lattice embeddings of trees (Q1024313) (← links)
- Transitive, locally finite median graphs with finite blocks (Q1043799) (← links)
- A bound for groups of linear growth (Q1070340) (← links)
- (Q1133555) (redirect page) (← links)
- Tournaments with given regular group (Q1133556) (← links)
- A survey on graphs with polynomial growth (Q1191916) (← links)
- Simple tournaments and sharply transitive groups (Q1201246) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- On graphical representations of cyclic extensions of groups (Q1214439) (← links)
- Eine Charakterisierung konvexer Mengen (Q1217343) (← links)
- Sense preserving groups of polyhedral graphs (Q1220084) (← links)
- Associative products of graphs (Q1226506) (← links)
- On the connectivity of Cayley graphs (Q1227751) (← links)
- On automorphisms of Cayley graphs (Q1229229) (← links)
- On finitely generated subgroups of free groups (Q1249228) (← links)
- On the number of subgroups of given index in \(SL(Z)\) (Q1255097) (← links)
- On the number of subgroups of given index in the modular group (Q1257980) (← links)
- A note on the growth of transitive graphs (Q1263596) (← links)
- A convexity lemma and expansion procedures for bipartite graphs (Q1272768) (← links)
- Recognizing median graphs in subquadratic time (Q1285576) (← links)
- Recognizing graphs of acyclic cubical complexes (Q1302166) (← links)
- On Howson's theorem (Q1319582) (← links)
- Recognizing Cartesian graph bundles (Q1356477) (← links)
- Fast recognition algorithms for classes of partial cubes (Q1408812) (← links)
- Factoring cardinal product graphs in polynomial time (Q1584444) (← links)
- On a theorem of Halin (Q1688265) (← links)
- Cartesian products of directed graphs with loops (Q1709534) (← links)
- Vertex-transitive direct products of graphs (Q1753082) (← links)
- Embedding graphs in Cayley graphs (Q1820168) (← links)
- On graphs with regular groups (Q1843447) (← links)
- Separating double rays in locally finite planar graphs (Q1901031) (← links)
- Recognizing halved cubes in a constant time per edge (Q1902967) (← links)
- On the complexity of recognizing Hamming graphs and related classes of graphs (Q1911841) (← links)
