Mohar, Bojan
Overview
Works:  795 works in 882 publications in 3 languages and 1,771 library holdings 

Genres:  Conference papers and proceedings Dictionaries 
Roles:  Author, Thesis advisor, Editor, Translator, Other 
Publication Timeline
.
Most widely held works by
Bojan Mohar
Graphs on surfaces by
Bojan Mohar(
Book
)
11 editions published in 2001 in English and held by 515 WorldCat member libraries worldwide
"Graph theory is one of the fastest growing branches of mathematics. Until recently, it was regarded as a branch of combinatorics and was best known by the famous fourcolor theorem stating that any map can be colored using only four colors such that no two bordering countries have the same color. Now graph theory is an area of its own with many deep results and beautiful open problems. Graph theory has numerous applications in almost every field of science and has attracted new interest because of its relevance to such technological problems as computer and telephone networking and, of course, the internet." "In this new book in the Johns Hopkins Studies in the Mathematical Sciences series, Bojan Mohar and Carsten Thomassen look at a relatively new area of graph theory: that associated with curved surfaces." "Graphs on surfaces form a natural link between discrete and continuous mathematics. The book provides a rigorous and concise introduction to graphs on surfaces and surveys some of the recent developments in this area."Jacket
11 editions published in 2001 in English and held by 515 WorldCat member libraries worldwide
"Graph theory is one of the fastest growing branches of mathematics. Until recently, it was regarded as a branch of combinatorics and was best known by the famous fourcolor theorem stating that any map can be colored using only four colors such that no two bordering countries have the same color. Now graph theory is an area of its own with many deep results and beautiful open problems. Graph theory has numerous applications in almost every field of science and has attracted new interest because of its relevance to such technological problems as computer and telephone networking and, of course, the internet." "In this new book in the Johns Hopkins Studies in the Mathematical Sciences series, Bojan Mohar and Carsten Thomassen look at a relatively new area of graph theory: that associated with curved surfaces." "Graphs on surfaces form a natural link between discrete and continuous mathematics. The book provides a rigorous and concise introduction to graphs on surfaces and surveys some of the recent developments in this area."Jacket
Računalniški slovarček : angleškoslovenski, slovenskoangleški(
Book
)
3 editions published between 1985 and 1993 in English and Slovenian and held by 56 WorldCat member libraries worldwide
Angleškoslovenski in slovenskoangleški slovar računalniškega izrazoslovja
3 editions published between 1985 and 1993 in English and Slovenian and held by 56 WorldCat member libraries worldwide
Angleškoslovenski in slovenskoangleški slovar računalniškega izrazoslovja
Računalništvo(
Book
)
2 editions published between 1988 and 1991 in Slovenian and held by 48 WorldCat member libraries worldwide
Leksikon opisuje in razlaga gesla in pojme, ki s kakorkoli vežejo ne računalništvo: zgodovina računalništva, strojna in programska oprema, računalniški pojmi, teoretične osnove računalništva. Vključena so tudi gesla, ki dokaj popolno pokrivajo nekatere veje matematike, ki so posebej pomembne v računalništvu, npr. numerična matematika, kombinatorika, teorija grafov, teorija verjetnosti in statistika, abstraktna in linearna algebra, logika in teorija množic
2 editions published between 1988 and 1991 in Slovenian and held by 48 WorldCat member libraries worldwide
Leksikon opisuje in razlaga gesla in pojme, ki s kakorkoli vežejo ne računalništvo: zgodovina računalništva, strojna in programska oprema, računalniški pojmi, teoretične osnove računalništva. Vključena so tudi gesla, ki dokaj popolno pokrivajo nekatere veje matematike, ki so posebej pomembne v računalništvu, npr. numerična matematika, kombinatorika, teorija grafov, teorija verjetnosti in statistika, abstraktna in linearna algebra, logika in teorija množic
Uvod v programiranje by
Bojan Mohar(
Book
)
5 editions published between 1982 and 1984 in Slovenian and Undetermined and held by 21 WorldCat member libraries worldwide
Uvodno poglavje predstavi bistvene značilnosti računalnika in programskih jezikov ter podajanje sintakse programskih jezikov. V osrednjem delu je opisan programski jezik pascal. Vzporedno pa knjiga navaja in s številnimi primeri ilustrira principe dobrega programiranja. Na koncu so naštete posebnosti prevajalnikov za pascal na nekaterih računalnikih. Priloge vsebujejo pregled standardnih podprogramov
5 editions published between 1982 and 1984 in Slovenian and Undetermined and held by 21 WorldCat member libraries worldwide
Uvodno poglavje predstavi bistvene značilnosti računalnika in programskih jezikov ter podajanje sintakse programskih jezikov. V osrednjem delu je opisan programski jezik pascal. Vzporedno pa knjiga navaja in s številnimi primeri ilustrira principe dobrega programiranja. Na koncu so naštete posebnosti prevajalnikov za pascal na nekaterih računalnikih. Priloge vsebujejo pregled standardnih podprogramov
Programski jezik pascal by
Bojan Mohar(
Book
)
3 editions published between 1986 and 1989 in Slovenian and held by 16 WorldCat member libraries worldwide
3 editions published between 1986 and 1989 in Slovenian and held by 16 WorldCat member libraries worldwide
Teorija matroidov by
Bojan Mohar(
Book
)
3 editions published between 1996 and 2016 in Slovenian and held by 14 WorldCat member libraries worldwide
3 editions published between 1996 and 2016 in Slovenian and held by 14 WorldCat member libraries worldwide
Matematika(
Book
)
1 edition published in 2003 in Slovenian and held by 12 WorldCat member libraries worldwide
1 edition published in 2003 in Slovenian and held by 12 WorldCat member libraries worldwide
Matematika(
Book
)
1 edition published in 2002 in Slovenian and held by 11 WorldCat member libraries worldwide
1 edition published in 2002 in Slovenian and held by 11 WorldCat member libraries worldwide
Algebraic and topological methods in graph theory by
Vladimir Batagelj(
Book
)
6 editions published between 1994 and 2007 in English and held by 10 WorldCat member libraries worldwide
6 editions published between 1994 and 2007 in English and held by 10 WorldCat member libraries worldwide
Uvod v računalništvo : naloge(
Book
)
1 edition published in 1983 in Slovenian and held by 8 WorldCat member libraries worldwide
1 edition published in 1983 in Slovenian and held by 8 WorldCat member libraries worldwide
Enajsta šola računalništva : rešene naloge z republiških tekmovanj 19771987(
Book
)
1 edition published in 1988 in Slovenian and held by 8 WorldCat member libraries worldwide
1 edition published in 1988 in Slovenian and held by 8 WorldCat member libraries worldwide
Prvi koraki v Basicu by
Susan Curran(
Book
)
1 edition published in 1985 in Slovenian and held by 8 WorldCat member libraries worldwide
1 edition published in 1985 in Slovenian and held by 8 WorldCat member libraries worldwide
Graph theory(
Book
)
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Tekmujmo za Vegova priznanja : zbirka rešenih nalog iz matematike za učence sedmih razredov osnovnih šol by
Pavel Zajc(
Book
)
2 editions published in 1987 in Slovenian and held by 7 WorldCat member libraries worldwide
2 editions published in 1987 in Slovenian and held by 7 WorldCat member libraries worldwide
Priprava besedil na računalniku Partner ROFF3 by
Bojan Mohar(
Book
)
2 editions published in 1985 in Slovenian and held by 5 WorldCat member libraries worldwide
2 editions published in 1985 in Slovenian and held by 5 WorldCat member libraries worldwide
Face covers and the genus of apex graphs by
Bojan Mohar(
Book
)
3 editions published in 1998 in English and held by 5 WorldCat member libraries worldwide
Graf z vrhom je vsak graf $G$, ki vsebuje tako točko $w$, da je $Gw$ ravninski. Pokazana je zelo tesna zveza med rodom grafa z vrhom in minimalnimi pokritji točk z lici ravninskega grafa. Dokazano je tudi, da je problem roda grafa NPpoln tudi za grafe z vrhom
3 editions published in 1998 in English and held by 5 WorldCat member libraries worldwide
Graf z vrhom je vsak graf $G$, ki vsebuje tako točko $w$, da je $Gw$ ravninski. Pokazana je zelo tesna zveza med rodom grafa z vrhom in minimalnimi pokritji točk z lici ravninskega grafa. Dokazano je tudi, da je problem roda grafa NPpoln tudi za grafe z vrhom
Light paths in 4connected graphs in the plane and other surfaces by
Bojan Mohar(
Book
)
3 editions published in 1998 in English and held by 5 WorldCat member libraries worldwide
Dokazanih je več rezultatov o obstoju podgrafov (posebej $k$poti) v ravninskih grafih in grafih omejenega roda, kjer je vsota stopenj točk podgrafa zelo majhna
3 editions published in 1998 in English and held by 5 WorldCat member libraries worldwide
Dokazanih je več rezultatov o obstoju podgrafov (posebej $k$poti) v ravninskih grafih in grafih omejenega roda, kjer je vsota stopenj točk podgrafa zelo majhna
A survey on spectra of infinite graph[sic] by
Bojan Mohar(
Book
)
2 editions published in 1988 in English and Italian and held by 5 WorldCat member libraries worldwide
2 editions published in 1988 in English and Italian and held by 5 WorldCat member libraries worldwide
Pascal  prevajalniki na osebnih in hišnih računalnikih by
Bojan Mohar(
Book
)
1 edition published in 1985 in Slovenian and held by 5 WorldCat member libraries worldwide
1 edition published in 1985 in Slovenian and held by 5 WorldCat member libraries worldwide
Approximation algorithms via contraction decomposition by
Erik D Demaine(
Book
)
2 editions published in 2006 in English and held by 4 WorldCat member libraries worldwide
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number $k$ of pieces such that contracting any piece results in a graph of bounded treewidth (where the bound dependson~$k$). This decomposition result parallels an analogous, simpler result for edge deletions instead of contractions, obtained by Baker, Eppstein, and others, and it generalizes a similar result for "compression" (a variant of contraction) in planar graphs (Klein). Our decomposition result is a powerful tool for obtaining PTASs for contractionclosed problems (whose optimal solution only improves under contraction), a much more general class than minorclosed problems. We prove that any contractionclosed problem satisfying just a few simple conditions has a PTAS in boundedgenus graphs. In particular, our framework yields PTASs for the weighted Traveling Salesman Problem and for minimumweight $c$edgeconnected submultigraph on boundedgenus graphs, improving and generalizing many previous algorithms. We also highlight the only main difficulty in extending our results to general $H$minorfree graphs
2 editions published in 2006 in English and held by 4 WorldCat member libraries worldwide
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number $k$ of pieces such that contracting any piece results in a graph of bounded treewidth (where the bound dependson~$k$). This decomposition result parallels an analogous, simpler result for edge deletions instead of contractions, obtained by Baker, Eppstein, and others, and it generalizes a similar result for "compression" (a variant of contraction) in planar graphs (Klein). Our decomposition result is a powerful tool for obtaining PTASs for contractionclosed problems (whose optimal solution only improves under contraction), a much more general class than minorclosed problems. We prove that any contractionclosed problem satisfying just a few simple conditions has a PTAS in boundedgenus graphs. In particular, our framework yields PTASs for the weighted Traveling Salesman Problem and for minimumweight $c$edgeconnected submultigraph on boundedgenus graphs, improving and generalizing many previous algorithms. We also highlight the only main difficulty in extending our results to general $H$minorfree graphs
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Thomassen, Carsten 1948
 Gams, Matjaž računalništvo Editor
 Petkovšek, Marko 1955
 Rapoša, Kazimir Editor
 Brodnik, Andrej
 Kodek, Dušan Editor
 Juvan, Martin Other Thesis advisor Author
 Drobnič, Matija
 Dobrin, Andrej
 Pisanski, Tomaž Thesis advisor Author Editor
Useful Links