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
Periods
January 1, 1999 - December 31, 2003
Research activity

Code Science Field Subfield
1.01.00  Natural sciences and mathematics  Mathematics   

Code Science Field
P110  Natural sciences and mathematics  Mathematical logic, set theory, combinatories 
P170  Natural sciences and mathematics  Computer science, numerical analysis, systems, control 
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.  22402  PhD Drago Bokal  Mathematics  Researcher  2002 - 2003  240 
2.  16332  PhD Gašper Fijavž  Mathematics  Researcher  2001 - 2003  121 
3.  11220  PhD Martin Juvan  Mathematics  Researcher  2001 - 2003  235 
4.  13429  MSc Jože Marinček  Mathematics  Researcher  2001 - 2003  29 
5.  01931  PhD Bojan Mohar  Mathematics  Head  2001 - 2003  1,002 
6.  12207  PhD Tomaž Slivnik  Mathematics  Researcher  2001 - 2002  10 
7.  13432  PhD Mateja Šajna  Mathematics  Researcher  2001 - 2003  33 
8.  15518  PhD Riste Škrekovski  Mathematics  Researcher  2001 - 2003  508 
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 are studied. We try to characterize obstructions for existence of embeddings and embedding extensions and develop efficient algorithms for embedding graphs. We study (Laplacian) spectral properties and the face-width of embedded graphs. Moreover, we perform research on (list) colorings of graphs, existence of subdivisions and minors in graphs, minor monotone invariants, connectivity properties, and graph decompositions, study various graph classes, and consider applications in graph drawing and in mathematical chemistry.
Confirmation required
Views history
Favourite