Filters
cris logo
-
New search Filters
Select from list
Displayed from Show more
You have reached the maximum number of displayed search results.
All results displayed
No results are available for the search performed
Displayed from
You have reached the maximum number of displayed search results.
All results displayed
Loading results
Obtaining statistical data

Projects / Programmes source: ARIS

Topološka teorija grafov (Slovene)

Edit
Research activity

Code Science Field Subfield
1.01.05  Natural sciences and mathematics  Mathematics  Graph theory 

Code Science Field
P110  Natural sciences and mathematics  Mathematical logic, set theory, combinatories 
Keywords
graph, surface, list coloring, algorithm, face-width, eigenvalues
Evaluation (rules)
source: COBISS
Evaluation of bibliographic research performance indicators according to ARIS methodology
Citations Citations for bibliographic records in COBIB.SI that are linked to records in citation databases
source: WoS source: Scopus source: COBISS
Researchers (8)
no. Code Name and surname Research area Role Period No. of publications
1.  16332  PhD Gašper Fijavž  Mathematics  Researcher  1998 - 2001  121 
2.  11220  PhD Martin Juvan  Mathematics  Researcher  1998 - 2001  235 
3.  13429  MSc Jože Marinček  Mathematics  Researcher  1998 - 2001  29 
4.  01931  PhD Bojan Mohar  Mathematics  Head  2000 - 2001  1,002 
5.  12207  PhD Tomaž Slivnik  Mathematics  Researcher  2000 - 2001  10 
6.  13432  PhD Mateja Šajna  Mathematics  Researcher  1998 - 2001  33 
7.  15518  PhD Riste Škrekovski  Mathematics  Researcher  1999 - 2001  508 
8.  00213  PhD Egon Zakrajšek  Mathematics  Researcher  1998 - 2001  207 
Organisations (1)
no. Code Research organisation City Registration number No. of publications
1.  0101  Institute of Mathematics, Physics and Mechanics  Ljubljana  5055598000  20,223 
Abstract
Properties of graphs embedded in closed surfaces will be studied. We will try to characterize obstructions for existence of embeddings and embedding extensions and develop efficient algorithms for embedding graphs. We will study (Laplacian) spectral properties and the face-width of embedded graphs. Moreover, we will perform research on (list) colorings of graphs on surfaces, flows, and existence of subdivisions in graphs.
Confirmation required
Views history
Favourite