WorldCat Identities

Mohar, Bojan

Overview
Works: 841 works in 927 publications in 3 languages and 1,835 library holdings
Genres: Conference papers and proceedings  Dictionaries 
Roles: Author, Thesis advisor, Editor, Translator, Other, Interviewee, 958
Classifications: QA166, 511.5
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 510 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 four-color 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ško-slovenski, slovensko-angleški( Book )

3 editions published between 1985 and 1993 in English and Slovenian and held by 56 WorldCat member libraries worldwide

Angleško-slovenski in slovensko-angleš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
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
Programski jezik pascal by Bojan Mohar( Book )

3 editions published between 1986 and 1989 in Slovenian and held by 16 WorldCat member libraries worldwide

Prvi koraki v Basicu by Susan Curran( Book )

1 edition published in 1985 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 15 WorldCat member libraries worldwide

Matematika( Book )

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

Algebraic and topological methods in graph theory by Slovenian Conference on Algebraic and Topological Methods in Graph Theory( Book )

5 editions published between 1994 and 2007 in English and held by 10 WorldCat member libraries worldwide

Enajsta šola računalništva : rešene naloge z republiških tekmovanj 1977-1987( Book )

1 edition published in 1988 in Slovenian and held by 8 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

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

Graph theory( Book )

3 editions published in 1998 in English 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

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 $G-w$ 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 NP-poln tudi za grafe z vrhom
Light paths in 4-connected 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
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

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

Structural approach to the crossing number of graphs : doctoral thesis by Drago Bokal( Book )

1 edition published in 2006 in English and held by 4 WorldCat member libraries worldwide

Raziskovanje prekrižno-kritičnih grafov je začel Širáň, ki je za vsak cel $k \ge 3$ konstruiral neskončno družino $3$-povezanih $k$-prekrižno-kritičnih grafov. Kochol je za vsak cel $k \ge 2$ konstruiral neskončno družino enostavnih $3$-povezanih $k$-prekrižno-kritičnih grafov. Richter in Thomassen sta začela s študijem stopenj vozlišč v prekrižno-kritičnih grafih, ko sta pokazala, da za vsaka cela $r \ge 6$ in $k \ge 1$ obstaja le končno mnogo $k$-prekrižno-kritičnih grafov z minimalno stopnjo $r$. Salazar je opazil, da iz njunega argumenta sledi obstoj le končno mnogo $k$-prekrižno-kritičnih grafov s povprečno stopnjo $r$ za vsak cel $k \ge 1$ in vsak racionalen $r>6$. Pokazal je, da za vsak racionalen $r \in (4,6)$ obstaja tako zaporedje $\{k_{r,i}\}_{i=0}^{\infty}$, da za vsak $i \in \NN$ obstaja neskončna družina $k_{r,i}$-prekrižno-kritičnih grafov s povprečno stopnjo $r$, in vprašal po obstoju takih družin za $r \in (3,4)$. Na vprašanje sta delno pozitivno odgovorila Pinontoan in Richter,ki sta razvila teorijo tlakovcev in z njeno pomočjo konstruirala iskane družine za $r \in (3\frac{1}{2},4)$. V disertaciji nadgradimo njuno delo,da omogoči posplošitev prekrižno-kritičnih grafov, ki jih je konstruiral Kochol. Kombinacija teorije tlakovcev in nove operacije na grafih in njihovih risbah, šiva, nam omogoči popoln odgovor na Salazarjevo vprašanjein njegovo povezavo z rezultati Širáňa in Kochola v obliki naslednjega izreka: obstaja taka zvezna konveksna funkcija $f:(3,6) \to \RR^+$, da za vsako racionalno število $r \in (3,6)$ in vsako celo število $k \ge f(r)$ obstaja neskončna družina prekrižno-kritičnih grafov s povprečno stopnjo $r$ in prekrižnim številom $k$. Beineke in Ringeisen sta raziskovala prekrižno število kartezičnih produktov malih grafov in ciklov ter določila natančne vrednosti za vse $C_n \Box G$, kjer je $G$ poljuben graf reda štiri, razen $3$-zvezda $K_{1,3}$. Jendrol' in Ščerbová sta zapolnila to vrzel. Ugotovila sta tudi prekrižno število $P_m \Box K_{1,3}$ in postavila domnevo za splošen rezultat o $P_m \Box K_{1,n}$. Domnevo je za $n = 4$ dokazal Klešč. V nekoliko splošnejši različici jo za vsak $n \ge 3$ dokažemo v pričujočem delu: rezultat Asana o prekrižnem številu grafa $K_{1,3,n}$ povežemo z operacijo šiv in dobimo prekrižno število grafa $T \Box K_{1,n}$, kjer je $T$ poljubno drevo z maksimalno stopnjo tri in $n \ge 3$ poljubno celo število. Ta rezultat dopolnimo s prekrižnim številom grafov $T \Box K_{1,3}$ za poljubno drevo $T$, prekrižnim številom grafov $P_m \Box W_n$ za poljubna $m \ge 1$, $n \ge 3$, ter več drugimi eksaktnimi rezultati in mejami. Seymour je obžaloval, da prekrižno število ne sodeluje na naraven način s teorijo grafovskih minorjev: stiskanje povezave lahko vrednost te invariante poveča ali zmanjša. V tem delu uvedemo minorsko prekrižno število. To je minorsko monotona invarianta, ki omogoča dodatno zmanjševanje števila križišč v risbi, tako da vozlišča zamenjamo z z drevesi in minimiziramo število križišč v risbah vseh takih grafov. Ta invarianta ima bolj naravne uporabe pri izdelavi elektronskih vezij kot navadno prekrižno število. V delu pokažemo več splošnih mej za njeno vrednost, raziščemo strukturo grafov z omejenim minorskim prekrižnim številom in predstavimo nekaj eksaktnih rezultatov in mej za posamezne družine grafov. Ena od spodnjih mej je posplošitev rezultata Morene in Salazarja, ki sta prekrižno število grafa omejila s prekrižnim številom njegovega minorja z majhno maksimalno stopnjo
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.58 (from 0.46 for Graphs on ... to 0.93 for A survey o ...)

Graphs on surfaces
Covers
Alternative Names
Bojan Mohar Canadees wiskundige

Bojan Mohar matemàtic eslovè

Bojan Mohar matemático esloveno

Bojan Mohar matemáticu canadianu

Bojan Mohar matematikan slloven

Bojan Mohar Slovene mathematician

Bojan Mohar slovenski matematik

Mohar, B.

Languages