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

Graph minors, graphs on surfaces and networks

Edit
Research activity

Code Science Field Subfield
1.01.00  Natural sciences and mathematics  Mathematics   

Code Science Field
P001  Natural sciences and mathematics  Mathematics 
P110  Natural sciences and mathematics  Mathematical logic, set theory, combinatories 
Keywords
graph minors, graph embeddings, connectivity, graph and network flows
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 (6)
no. Code Name and surname Research area Role Period No. of publications
1.  25993  PhD Sergio Cabello Justo  Mathematics  Researcher  2005  218 
2.  15313  MSc Igor Đukanović  Mathematics  Researcher  2005  29 
3.  16332  PhD Gašper Fijavž  Mathematics  Researcher  2003 - 2005  121 
4.  13429  MSc Jože Marinček  Mathematics  Researcher  2003 - 2005  29 
5.  01931  PhD Bojan Mohar  Mathematics  Head  2003 - 2005  1,002 
6.  22649  PhD Janez Povh  Computer intensive methods and applications  Researcher  2005  341 
Organisations (1)
no. Code Research organisation City Registration number No. of publications
1.  0101  Institute of Mathematics, Physics and Mechanics  Ljubljana  5055598000  20,227 
Abstract
The main subject of our research will be the interplay of graph minors and connectivity. The main question which arises is the following: does a high enough connectivity of a graph, possibly applied together with some other topological conditions, guarantee the existence of a specified graph minor. One possible approach to this problem is the use of graphs embedded into surfaces and using conditions related to such an embedding. So far, we have been able to reduce several problems of this kind to finding a set of disjoint paths linking prescribed pairs of graph vertices. Such a theoretical problem has its real-life counterpart. Can pieces of information be sent across a (computer) network, so that their respective paths remain disjoint. We expect that techniques developed in the theoretical part of this project may be applied in the analysis and the design of algorithms for data flow in computer networks.
Confirmation required
Views history
Favourite