I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Imrich, Wilfried
77
results:
Articles (Online) X
Search for persons
X
Languages
german (12)
english (65)
Sorted by: Relevance
Sorted by: Year
?
1
Distinguishing density and the Distinct Spheres Condition:
Imrich, Wilfried
;
Lehner, Florian
;
Smith, Simon M.
European Journal of Combinatorics. 89 (2020) - p. 103139 , 2020
Link:
https://doi.org/10.1016/..
?
2
RECOGNIZING GENERALIZED SIERPIŃSKI GRAPHS:
Imrich, Wilfried
;
Peterin, Iztok
Applicable Analysis and Discrete Mathematics. 14 (2020) 1 - p. 122-137 , 2020
Link:
https://www.jstor.org/st..
?
3
Recognizing generalized Sierpiński graphs:
Imrich, Wilfried
;
Peterin, Iztok
Applicable Analysis and Discrete Mathematics. 14 (2020) 1 - p. 122-137 , 2020
Link:
https://doi.org/10.2298/..
?
4
Asymmetrizing trees of maximum valence $$2^{\aleph _0}$$:
Imrich, Wilfried
;
Tucker, Thomas W.
Monatshefte für Mathematik. 192 (2020) 3 - p. 615-624 , 2020
Link:
https://doi.org/10.1007/..
?
5
Asymmetric colorings of products of graphs and digraphs:
Broere, Izak
;
Imrich, Wilfried
;
Kalinowski, Rafał
.
Discrete Applied Mathematics. 266 (2019) - p. 56-64 , 2019
Link:
https://doi.org/10.1016/..
?
6
Cartesian products of directed graphs with loops:
Imrich, Wilfried
;
Peterin, Iztok
Discrete Mathematics. 341 (2018) 5 - p. 1336-1343 , 2018
Link:
https://doi.org/10.1016/..
?
7
On a theorem of Halin:
Imrich, Wilfried
;
Smith, Simon M.
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 87 (2016) 2 - p. 289-297 , 2016
Link:
https://doi.org/10.1007/..
?
8
Boxicity and cubicity of product graphs:
Chandran, L. Sunil
;
Imrich, Wilfried
;
Mathew, Rogers
.
European Journal of Combinatorics. 48 (2015) - p. 100-109 , 2015
Link:
https://doi.org/10.1016/..
?
9
Edge-transitive products:
Hammack, Richard
;
Imrich, Wilfried
;
Klavžar, Sandi
Journal of Algebraic Combinatorics. 43 (2015) 4 - p. 837-850 , 2015
Link:
https://doi.org/10.1007/..
?
10
Erratum to: Infinite motion and 2-distinguishability of gra..:
Imrich, Wilfried
;
Smith, Simon M.
;
Tucker, Thomas W.
.
Journal of Algebraic Combinatorics. 41 (2014) 1 - p. 123-123 , 2014
Link:
https://doi.org/10.1007/..
?
11
Infinite motion and 2-distinguishability of graphs and grou..:
Imrich, Wilfried
;
Smith, Simon M.
;
Tucker, Thomas W.
.
Journal of Algebraic Combinatorics. 41 (2014) 1 - p. 109-122 , 2014
Link:
https://doi.org/10.1007/..
?
12
Partial Star Products: A Local Covering Approach for the Re..:
Hellmuth, Marc
;
Imrich, Wilfried
;
Kupka, Tomas
Mathematics in Computer Science. 7 (2013) 3 - p. 255-273 , 2013
Link:
https://doi.org/10.1007/..
?
13
Preface:
Hell, Pavol
;
Imrich, Wilfried
;
Nešetřil, Jaroslav
Discrete Mathematics. 312 (2012) 1 - p. 1 , 2012
Link:
https://doi.org/10.1016/..
?
14
Two-ended regular median graphs:
Imrich, Wilfried
;
Klavžar, Sandi
Discrete Mathematics. 311 (2011) 15 - p. 1418-1422 , 2011
Link:
https://doi.org/10.1016/..
?
15
NZ‐flows in strong products of graphs:
Imrich, Wilfried
;
Peterin, Iztok
;
Špacapan, Simon
.
Journal of Graph Theory. 64 (2010) 4 - p. 267-276 , 2010
Link:
https://doi.org/10.1002/..
1-15