Imrich, Wilfried
Imrich, Wilfried, 1941-
Wilfried Imrich mathématicien autrichien
Imrich, W. (Wilfried), 1941-
VIAF ID: 12537907 ( Personal )
Permalink: http://viaf.org/viaf/12537907
Preferred Forms
- 200 _ | ‡a Imrich ‡b Wilfried ‡f 1941-....
-
- 100 1 _ ‡a Imrich, Wilfried
-
- 100 1 _ ‡a Imrich, Wilfried
- 100 1 _ ‡a Imrich, Wilfried
- 100 1 _ ‡a Imrich, Wilfried
-
-
- 100 1 _ ‡a Imrich, Wilfried ‡d 1941-
-
-
- 100 1 _ ‡a Imrich, Wilfried, ‡d 1941-
-
- 100 0 _ ‡a Wilfried Imrich ‡c mathématicien autrichien
4xx's: Alternate Name Forms (9)
5xx's: Related Names (5)
- 510 2 _ ‡a Institut für Mathematik und Angewandte Geometrie ‡g Leoben ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Institut für Mathematik und Angewandte Geometrie (Leoben)
- 510 2 _ ‡a Technische Universität Wien ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Technische Universität Wien
- 510 2 _ ‡a Österreichische Akademie der Wissenschaften Mathematisch-Naturwissenschaftliche Klasse
Works
Title | Sources |
---|---|
Characterization of trivalent graphs with minimal eigenvalue gap | |
A convexity lemma and expansion procedures for bipartite graphs | |
Distinguishing Cartesian products of countable graphs | |
Edge-transitive lexicographic and cartesian products | |
Factoring directed graphs with respect to the cardinal product in polynomial time II | |
Fast recognition algorithms for classes of partial cubes | |
From efficient closed domination over independence number to the Vizing Conjecture | |
Funkcija oddaljenosti v medianskih grafih. | |
Hiperkocke kot direktni produkti. | |
Hitri prepoznavni algoritmi za razrede delnih kock. | |
Hypercubes as direct products | |
Karakterizacija razpolovljenih kock. | |
Konveksna lema ter razširitveni postopki za dvodelne grafe. | |
Lastnosti krajšanja za produkte grafov. | |
Lattice embeddings of trees | |
Median graphs and triangle-free graphs | |
Medianski grafi in grafi brez trikotnikov. | |
Metric properties of graphs and applications to organic chemistry | |
Multiple Kronecker covering graphs | |
On Cartesian skeletons of graphs | |
On the remoteness function in median graphs | |
Povezavno-tranzitivni produkti. | |
Prepoznavanje medianskih grafov v podkvadratičnem času. | |
Prepoznavanje posplošenih grafov Sierpińskega. | |
Prepoznavanje razpolovljenih kock v konstantnem času za povezavo. | |
A Prime Factor Theorem for a Generalized Direct Product | |
Product graphs, structure, and recognition | |
Razlikovalni indeks povezanih grafov brez visečih robov. | |
Razlikovanje neskončnih grafov. | |
Razpoznavanje Hammingovih grafov v linearnem času in prostoru. | |
Razpoznavanje kartezičnih grafovskih svežnjev. | |
Realisierung von Metriken in Graphen | |
Recognizing cartesian graph bundles | |
Recognizing generalized Sierpiński graphs | |
Recognizing graphs of acyclic cubical complexes | |
Recognizing halved cubes in a constant time per edge | |
Recognizing median graphs in subquadratic time | |
Reconstructing subgraph-counting graph polynomials of increasing families of graphs | |
Regularni medianski grafi z dvema koncema. | |
Rekonstrukcija podgrafovsko-preštevalnih polinomov za naraščajoče družine grafov. | |
O rekonstrukciji kartezičnega produkta grafov. | |
Relacije med medianskimi grafi, semi-medianskimi grafi in delnimi kockami. | |
Relations between median graphs, semi-median graphs and partial cubes | |
Retracts of strong products of graphs | |
Retrakti krepkih produktov grafov. | |
Simple tournaments and sharply transitive groups | |
Teorija grafov. | |
Tiled partial cubes and Euler-type formulas | |
Tlakovane delne kocke. | |
Topics in graph theory : graphs and their cartesian product | |
Topological graph theory and graph invariants. | |
Transitive, locally finite median graphs with finite blocks | |
Tranzitivni, lokalno končni medianski grafi s končnimi bloki. | |
Tree-like isometric subgraphs of hypercubes | |
Über das starke Produkt von endlichen Graphen | |
Weak k-reconstruction of Cartesian products | |
O zahtevnosti razpoznavanja Hammingovih in drugih sorodnih razredov grafov. |