\clan {Bojan Mohar}

%--------------------------------------------------------
%  A. objavljene znanstvene monografije
%--------------------------------------------------------


%\begin{skupina}{A}

%\disertacija
%   {NASLOV}
%   {UNIVERZA}
%   {FAKULTETA}
%   {ODDELEK}
%   {KRAJ} {DRZAVA} {LETO} 

%\magisterij
%   {NASLOV}
%   {UNIVERZA}
%   {FAKULTETA}
%   {ODDELEK}
%   {KRAJ} {DRZAVA} {LETO} 

%\monografija
%   {AVTORJI}
%   {NASLOV}
%   {ZALOZBA}
%   {KRAJ} {DRZAVA} {LETO} 

%\end{skupina} 


%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  B. raziskovalni clanki sprejeti v objavo v znanstvenih
%     revijah in v zbornikih konferenc
%--------------------------------------------------------

%\begin{skupina}{B}

%\sprejetoRevija
%   {AVTORJI}
%   {NASLOV}
%   {REVIJA}
%\sprejetoZbornik
%   {AVTORJI}
%   {NASLOV}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 

%\end{skupina} 

\begin{skupina}{B}

\sprejetoRevija
   {F.~Knox, \crta}
   {Maximum number of colourings: 4-chromatic graphs}
   {J. Combin.\ Theory Ser.\ B}

\sprejetoRevija
   {Y.~Jing, \crta}
   {The genus of a random bipartite graph}
   {Canad.\ J. Math.}

\sprejetoRevija
   {Y.~Jing, \crta}
   {The genus of complete 3-uniform hypergraphs}
   {J. Combin.\ Theory Ser.\ B}

\sprejetoRevija
   {K.~Kawarabayashi, P.~Klav\'ik, \crta, R.~Nedela, P.~Zeman}
   {Isomorphisms of maps on the sphere}
   {Contemp.\ Math.}

\sprejetoRevija
   {S.A.~Hosseini, F.~Knox, \crta}
   {Cops and Robbers on graphs of bounded diameter}
   {SIAM J. Discrete Math.}

\sprejetoRevija
   {\crta, N.~Singer}
   {The last temptation of William T.~Tutte}
   {European J. Combin.}

\end{skupina}

%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  C. raziskovalni clanki objavljeni v znanstvenih revijah
%     in v zbornikih konferenc
%--------------------------------------------------------

%\begin{skupina}{C}

%\objavljenoRevija
%   {AVTORJI}
%   {NASLOV}
%   {REVIJA} {LETNIK} {LETO} {STEVILKA} {STRANI}

%\objavljenoZbornik
%   {AVTORJI}
%   {NASLOV}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 
%   {ZBORNIK} {STRANI} 

%\end{skupina} 

\begin{skupina}{C}

\objavljenoRevija
% 1. S.~G.~Hermosillo De La Maza, B.~Mohar. Guarding isometric subgraphs and Lazy Cops and Robbers. Acta Math.\ Univ.\ Comenian.\ (N.S.). Jul. 2019, vol. 88, no. 3, str. 743-747. http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1304/721. [COBISS.SI-ID 18856537] 
   {S.~G.~Hermosillo De La Maza, \crta}
   {Guarding isometric subgraphs and Lazy Cops and Robbers}
   {Acta Math.\ Univ.\ Comenian.\ (N.S.)} {88} {2019} {} {743--747}

\objavljenoRevija
% 2. F.~Knox, B.~Mohar, D.~R.~Vood. A golden ratio inequality for vertex degrees of graphs. Amer.\ Math.\ Monthly. 2019, vol. 126, iss. 8, str. 742-747. ISSN 0002-9890. https://doi.org/10.1080/00029890.2019.1627153, DOI: 10.1080/00029890.2019.1627153. [COBISS.SI-ID 18856793] 
   {F.~Knox, \crta, D.~R.~Vood}
   {A golden ratio inequality for vertex degrees of graphs}
   {Amer.\ Math.\ Monthly} {126} {2019} {} {742--747}

\objavljenoRevija
% 3. H.~Chen, B.~Mohar. The sandpile group of a polygon flower. Discrete Appl.\ Math. [Print ed.]. Nov. 2019, vol. 270, str. 68-82. ISSN 0166-218X. https://doi.org/10.1016/j.dam.2019.07.020, DOI: 10.1016/j.dam.2019.07.020. [COBISS.SI-ID 18823257] 
   {H.~Chen, \crta}
   {The sandpile group of a polygon flower}
   {Discrete Appl.\ Math.} {270} {2019} {} {68--82}

\objavljenoRevija
% 4. F.~Knox, B.~Mohar. Maximum number of colourings: 5-chromatic case. Electron.\ J. Combin. [Online ed.]. 2019, iss. 3, paper p3.40, str. 1-8. ISSN 1077-8926. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i3p40. [COBISS.SI-ID 18856281] 
   {F.~Knox, \crta}
   {Maximum number of colourings: 5-chromatic case}
   {Electron.\ J. Combin.} {26} {2019} {} {P3.40 [10 str.]}

\objavljenoRevija
% 5. G.~Greaves, B.~Mohar, O, Suil. Interlacing families and the Hermitian spectral norm of digraphs. Linear Algebra Appl. [Print ed.]. March 2019, vol. 564, str. 201-208. ISSN 0024-3795. https://doi.org/10.1016/j.laa.2018.12.004, DOI: 10.1016/j.laa.2018.12.004. [COBISS.SI-ID 18602329] 
   {G.~Greaves, \crta, S.~O}
   {Interlacing families and the Hermitian spectral norm of digraphs}
   {Linear Algebra Appl.} {564} {2019} {} {201--208}

\objavljenoRevija
% 6. H.~H.~Li, B.~Mohar. On the first and second eigenvalue of finite and infinite uniform hypergraphs Proc.\ Amer.\ Math.\ Soc. March 2019, vol. 147, no. 3, str. 933-946. ISSN 0002-9939. https://doi.org/10.1090/proc/14274, DOI: 10.1090/proc/14274. [COBISS.SI-ID 18601305] 
   {H.~H.~Li, \crta}
   {On the first and second eigenvalue of finite and infinite uniform hypergraphs}
   {Proc.\ Amer.\ Math.\ Soc.} {147} {2019} {} {9{3}3-946}

\objavljenoRevija
   {Z.~Dvo\v{r}\'{a}k, \crta, R.~�\'{a}mal}
   {Exponentially many nowhere-zero $\mathbb{Z}_3$-, $\mathbb{Z}_4$-, and $\mathbb{Z}_6$-flows}
   {Combinatorica} {39} {2019} {} {1237--1253}

\objavljenoRevija
   {F.~Knox, \crta}
   {Fractional decompositions and the smallest-eigenvalue separation}
   {Electron.\ J. Combin.} {26} {2019} {} {art. P4.41 [6 str.]}

\objavljenoRevija
   {B.~M.~\'{A}brego, O.~Aichholzer, S.~Fern\'{a}ndez-Merchant, D.~McQuillan, \crta, P.~Mutzel, P.~Ramos, R.~B.~Richter, B.~Vogtenhuber}
   {Bishellable drawings of $K_n$}
   {SIAM J. Discrete Math.} {32} {2019}{} {2482--2492}

\objavljenoZbornik
%4. D.~Bokal, Z.~Dvo��k, P.~Hlin�n�, J.~Lean\~{o}s, B.~Mohar, T.~Wiedera. Bounded degree conjecture holds precisely for $c$-crossing-critical graphs with $c \leq 12$. V: BAREQUET, Gill (ur.), WANG, Yusu (ur.). 35th International Symposium on Computational Geometry : SoCG 2019, June 18-21, 2019, Portland, Oregon, USA. Saarbr�cken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum f�r Informatik GmbH, Dagstuhl Publishing, june 2019. 15 str. Leibniz international proceedings in informatics, 129. ISBN 978-3-95977-104-7. ISSN 1868-8969. https://drops.dagstuhl.de/opus/volltexte/2019/10418/pdf/LIPIcs-SoCG-2019-14.pdf, DOI: 10.4230/LIPIcs.SoCG.2019.14. [COBISS.SI-ID 18858585]  
   {D.~Bokal, Z.~Dvo��k, P.~Hlin�n�, J.~Lean\~{o}s, \crta, T.~Wiedera}
   {Bounded degree conjecture holds precisely for $c$-crossing-critical graphs with $c \leq 12$}
   {35\uth International Symposium on Computational Geometry}
   {Portland} {ZDA} {junij} {2019} 
   {Leibniz International Proceedings in Informatics (LIPIcs) 129 (2019)} {str. 14:1--14:15} 

\end{skupina} 

%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  D. urednistvo v znanstvenih revijah in zbornikih
%     znanstvenih konferenc
%--------------------------------------------------------

%\begin{skupina}{D}

%\urednikRevija
%   {OPIS}
%   {REVIJA}
%\urednikZbornik
%   {OPIS}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 

%\end{skupina} 


\begin{skupina}{D}

\urednikRevija
   {Glavni urednik}
   {Electronic Journal of Combinatorics}
\urednikRevija
   {Glavni urednik}
   {Journal of Combinatorial Theory. Series B}
\urednikRevija
   {�lan uredni�kega odbora}
   {Journal of Graph Theory}
\urednikRevija
   {�lan uredni�kega odbora}
   {MATCH. Communications in Mathematical and in Computer Chemistry}
\urednikRevija
   {Podro�ni urednik}
   {Discrete Mathematics}
\urednikRevija
   {�lan uredni�kega odbora}
   {Discrete and Computational Geometry}
\urednikRevija
   {�lan uredni�kega odbora}
   {Tbilisi Mathematical Journal}
\urednikRevija
   {Svetnik}
   {Ars Mathematica Contemporanea}

\urednikZbornik
% 10. S.~Cabello (urednik), B.~Mohar (urednik). Abstracts of the 9th Slovenian International Conference on Graph Theory, Bled, Slovenia, June 23-29, 2019. Ljubljana: Institute of Mathematics, Physics and Mechanics, IMFM, 2019. 171 str. ISBN 978-961-92681-1-7. https://conferences.matheo.si/event/28/material/0/4.pdf. [COBISS.SI-ID 300523520] 
   {Sourednik}
   {9\uth Slovenian International Conference on Graph Theory}
   {Bled} {} {junij} {2019} 

\end{skupina}


%    Ni podatkov za to sekcijo

%--------------------------------------------------------
%  E. organizacija mednarodnih in domacih znanstvenih 
%     srecanj
%--------------------------------------------------------

%\begin{skupina}{E}

%\organizacija
%   {OPIS}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 

%\end{skupina} 

\begin{skupina}{E}

\organizacija
   {�lan programskega odbora}
   {ACM-SIAM Symposium on Discrete Algorithms (SODA'19)}
   {San Diego, CA}{ZDA}{januar}{2019}

\organizacija
   {�lan programskega odbora}
   {The 5\uth Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2019)}
   {Kharagpur}{Indija}{februar}{2019}

\organizacija
   {�lan organizacijskega odbora}
   {Structural graph theory and graph colorings}
   {Tsinghua Sanya International Mathematics Forum}{Kitajska}{maj}{2019}

\organizacija
   {�lan organizacijskega odbora}
   {7\uth biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2019)}
   {Vancouver}{Kanada}{maj}{2019}

\organizacija
   {�lan organizacijskega odbora}
   {25\uth Birthday Celebration of The Electronic Journal of Combinatorics}
   {Vancouver}{Kanada}{maj}{2019}

\organizacija
   {Predsednik organizacijskega odbora}
   {9\uth Slovenian International Conference on Graph Theory (Bled 2019)}
   {Bled}{}{junij}{2019}

\organizacija
   {�lan programskega odbora}
   {45\uth International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019)}
   {Vall de N\'{u}ria}{�panija}{junij}{2019}

\organizacija
   {�lan programskega odbora}
   {Algorithms and Data Structures Symposium (WADS 2019)}
   {University of Alberta}{Kanada}{avgust}{2019}

\organizacija
   {�lan programskega odbora}
   {European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2019)}
   {Bratislava}{Slova�ka}{avgust}{2019}

\end{skupina}

%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  F. vabljena predavanja na tujih ustanovah in 
%     mednarodnih konferencah
%--------------------------------------------------------

%\begin{skupina}{F}

%\predavanjeUstanova
%   {NASLOV}
%   {OPIS}
%   {USTANOVA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO}
%\predavanjeKonferenca
%   {NASLOV}
%   {OPIS}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 

%\end{skupina} 

\begin{skupina}{F}

\predavanjeUstanova
   {Toward a theory of crossing-critical graphs}
   {Tutte Distinguished Speaker}
   {University of Waterloo}
   {Waterloo}{Kanada}{marec}{2019}

\predavanjeKonferenca
   {Structure and generation of crossing-critical graphs}
   {plenarno predavanje}
   {International Conference on Graph Theory and Combinatorics}
   {Beijing Jiaotong University}{Kitajska}{marec}{2019}

\predavanjeKonferenca
   {Crossing-critical graphs}
   {vabljeno predavanje}
   {Maps $\cup$ Configurations $\cup$ Polytopes $\cup$ Molecules $\subseteq$ Graphs}
   {Ljubljana}{}{maj}{2019}

\predavanjeKonferenca
   {Crossing-critical graphs}
   {plenarno predavanje}
   {Ghent Graph Theory Workshop On Structure and Algorithms (GGTW 2019)}
   {Ghent}{Belgija}{avgust}{2019}

\end{skupina}

%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  G. aktivne udelezbe na mednarodnih in domacih
%     konferencah
%--------------------------------------------------------

%\begin{skupina}{G}

%\konferenca
%   {NASLOV}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 

%\end{skupina} 

\begin{skupina}{G}

\konferenca
   {Coloring complex and a question of Tutte}
   {Structural graph theory and graph colorings}
   {Tsinghua Sanya International Mathematics Forum}{Kitajska}{maj}{2019}

\konferenca
   {Crossing critical graphs}
   {CanaDAM 2019}
   {Vancouver}{Kanada}{maj}{2019}

\konferenca
% 8. B.~Mohar. About the smallest eigenvalue of non-bipartite graphs. V: S.~Cabello (ur.), B.~Mohar (ur.). Abstracts of the 9th Slovenian International Conference on Graph Theory, Bled, Slovenia, June 23-29, 2019. Ljubljana: Institute of Mathematics, Physics and Mechanics, IMFM, 2019. Str. 142. ISBN 978-961-92681-1-7. [COBISS.SI-ID 18687065] 
   {About the smallest eigenvalue of non-bipartite graphs}
   {9\uth Slovenian International Conference on Graph Theory}
   {Bled} {} {junij} {2019} 

\konferenca
% 9. B.~Drago, DVO��K, Zden�k, HLIN�N�, Petr, LEAN?S, Jes�s, B.~Mohar. Bounded maximum degree conjecture holds precisely for $c$-crossing-critical graphs with $c \leq 12$. V: S.~Cabello (ur.), B.~Mohar (ur.). Abstracts of the 9th Slovenian International Conference on Graph Theory, Bled, Slovenia, June 23-29, 2019. Ljubljana: Institute of Mathematics, Physics and Mechanics, IMFM, 2019. Str. 62. ISBN 978-961-92681-1-7. [COBISS.SI-ID 18679385] 
   {Bounded maximum degree conjecture holds precisely for $c$-crossing-cri\-ti\-cal graphs with $c \leq 12$}
   {9\uth Slovenian International Conference on Graph Theory}
   {Bled} {} {junij} {2019}

\konferenca
   {Guarding isometric subgraphs and lazy cops and robbers}
   {Eurocomb 2019}
   {Bratislava}{Slova�ka}{avgust}{2019}

\konferenca
   {The last temptation of Tutte}
   {Waterloo Coloring Conference}
   {Waterloo}{Kanada}{september}{2019}

\konferenca
   {Meyniel�s conjecture on graphs of bounded degree}
   {CMS Winter Meeting}
   {Toronto}{Kanada}{december}{2019}

\end{skupina} 

%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  H. strokovni clanki
%--------------------------------------------------------

%\begin{skupina}{H}

%\clanekRevija
%   {AVTORJI}
%   {NASLOV}
%   {REVIJA} {LETNIK} {LETO} {STEVILKA} {STRANI}
%\clanekZbornik
%   {AVTORJI}
%   {NASLOV}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO}
%   {ZBORNIK} {STRANI} 

%\end{skupina} 


%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  I. razno
%--------------------------------------------------------

%\begin{skupina}{I}

%\razno
%   {OPIS} 

%  \end{skupina} 


%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  tuji gosti
%--------------------------------------------------------

%\begin{seznam}
%\gost {IME} {TRAJANJE} {USTANOVA} {KRAJ} {DRZAVA} {MESEC} {LETO} {POVABILO}
%\end{seznam} 

%--------------------------------------------------------
%  gostovanja
%--------------------------------------------------------

%\begin{seznam}
%\gostovanje {IME} {TRAJANJE} {USTANOVA} {KRAJ} {DRZAVA} {MESEC} {LETO}
%\end{seznam} 

