\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}

\sprejetoZbornik
  {R.~Churchley, \crta}
  {A submodular measure and approximate Gomory-Hu theorem for packing odd trails}
  {SODA 2018}
  {New Orleans} {ZDA} {januar} {2018}

\sprejetoRevija
  {D.~Gajser, \crta}
  {Minimal normal graph covers}
  {Combinatorica}

\sprejetoRevija
  {F.~Havet, A.~K.~Maia, \crta}
  {Finding a subdivision of a prescribed digraph of order 4}
  {J. Graph Theory}

\sprejetoRevija
  {C.~A.~Alfaro, A.~Arroyo, M.~Der\v n\'ar, \crta}
  {The crossing number of the cone of a graph}
  {SIAM J. Discrete Math.}

\sprejetoRevija
  {S.~A.~Hosseini, \crta}
  {Game of cops and robbers in oriented quotients of the integer grid}
  {Discrete Math.}

\sprejetoRevija
  {M. Kotrb\v{c}\'ik, N. Matsumoto, \crta, A. Nakamoto, K. Noguchi, K. Ozeki, A. Vodopivec}
  {Gr\"unbaum colorings of even triangulations on surfaces}
  {J. Graph Theory}

\sprejetoRevija
  {\crta}
  {The structure of ABC-minimal trees with given number of leaves}
  {MATCH Commun.\ Math.\ Comput.\ Chem.}

\end{skupina} 

%--------------------------------------------------------
%  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}


\objavljenoZbornik
% 1.08: {\bf 13}. DVO\v{R}\'{A}K, Zden\v{e}k, KR\'{A}L', Daniel, MOHAR, Bojan. Graphic TSP in cubic graphs. V: VOLLMER, Heribert (ur.), VALL\'{E}E, Brigitte (ur.). {\it 34th Symposium on Theoretical Aspects of Computer Science : STACS 2017, March 8-11, 2017, Hannover, Germany}}, (Leibniz international proceedings in informatics, ISSN 1868-8969, 66). Saarbr\"{u}cken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum f\"{u}r Informatik GmbH, Dagstuhl Publishing, March 2017, 13 str. $[$COBISS.SI-ID 18215001$]$\\ 
   {Z.~Dvo\v{r}\'{a}k, D.~Kr\'{a}l', \crta}
   {Graphic TSP in cubic graphs}
   {34\uth Symposium on Theoretical Aspects of Computer Science}
   {Hannover} {Nem�ija} {marec} {2017}
   {STACS 2017 (Leibniz international proceedings in informatics, 66)} {13 str.} 


\objavljenoZbornik
   {Z.~Dvo\v{r}\'{a}k, \crta, R.~\v S\'amal}
   {Exponentially many nowhere-zero $Z_3$-, $Z_4$-, and $Z_6$-flows}
   {The European Conference on Combinatorics, Graph Theory and Applications}
   {Dunaj} {Avstrija} {september} {2017}
   {EuroComb'17 (Electronic Notes in Discrete Mathematics, 61)} {375--381}


\objavljenoRevija
% 1.01: %list {\bf 2}. ARCHDEACON, Dan Steven, BONNINGTON, C. Paul, MOHAR, Bojan. Embedding quartic Eulerian digraphs on the plane.  {\it Australas.\ J. Combin.},  2017, vol. 67, part 2, str. 364-377. $[$COBISS.SI-ID 18212953$]$\\ 
   {D.~S.~Archdeacon, C.~Bonnington, \crta}
   {Embedding quartic Eulerian digraphs on the plane}
   {Australas.\ J. Combin.} {67} {2017} {} {364--37{7}}

\objavljenoRevija
% 1.01: {\bf 1}. ARCHDEACON, Dan Steven, DEVOS, Matt, HANNIE, Stefan, MOHAR, Bojan. Whitney's theorem for 2-regular planar digraphs.  {\it Australas.\ J. Combin.},  2017, vol. 67, part 2, str. 159-165. $[$COBISS.SI-ID 18213209$]$\\ 
   {D.~S.~Archdeacon, M.~Devos, Stef.~Hannie, \crta}
   {Whitney's theorem for 2-regular planar digraphs}
   {Australas.\ J. Combin.} {67} {2017} {} {159--165}

\objavljenoRevija
% 1.01: %list {\bf 9}. DVO\v{R}\'{A}K, Zden\v{e}k, LIDICK\'{Y}, Bernard, MOHAR, Bojan. 5-choosability of graphs with crossings far apart.  {\it J. Combin.\ Theory Ser.\ B},  2017, vol. 123, str. 54-96. $[$COBISS.SI-ID 18214489$]$\\ 
   {Z.~Dvo\v{r}\'{a}k, B.~Lidick\'{y}, \crta}
   {5-choosability of graphs with crossings far apart}
   {J. Combin.\ Theory Ser.\ B} {123} {2017} {} {54--96}

\objavljenoRevija
% 1.01: %list {\bf 8}. DVO\v{R}\'{A}K, Zden\v{e}k, LIDICK\'{Y}, Bernard, MOHAR, Bojan, POSTLE, Luke. 5-list-coloring planar graphs with distant precolored vertices. {\it J. Combin.\ Theory Ser.\ B},  2017, vol. 122, str. 311-352. $[$COBISS.SI-ID 17882713$]$\\ 
   {Z.~Dvo\v{r}\'{a}k, B.~Lidick\'{y}, \crta, L.~Postle}
   {5-list-coloring planar graphs with distant precolored vertices}
   {J. Combin.\ Theory Ser.\ B} {122} {2017} {} {31{1}--352}

\objavljenoRevija
% 1.01: %list {\bf 5}. GUO, Krystal, MOHAR, Bojan. Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths.  {\it Discrete Math.}, 2017, vol. 340, iss. 11, str. 2616-2632. $[$COBISS.SI-ID 18126425$]$\\ 
   {K.~Guo, \crta}
   {Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths}
   {Discrete Math.} {340} {2017} {} {2616--2632}

\objavljenoRevija
% 1.01: %list {\bf 11}. GUO, Krystal, MOHAR, Bojan. Hermitian adjacency matrix of digraphs and mixed graphs. {\it J. Graph Theory}, 2017, vol. 85, iss. 1, str. 217-248. $[$COBISS.SI-ID 18213721$]$\\ 
   {K.~Guo, \crta}
   {Hermitian adjacency matrix of digraphs and mixed graphs}
   {J. Graph Theory} {85} {2017} {} {217--248}

\objavljenoRevija
% 1.01: %list {\bf 10}. HARUTYUNYAN, Ararat, MOHAR, Bojan. Planar digraphs of digirth five are 2-colorable. {\it J. Graph Theory}, 2017, vol. 84, iss. 4, str. 408-427. $[$COBISS.SI-ID 18213977$]$\\ 
   {A.~Harutyunyan, \crta}
   {Planar digraphs of digirth five are 2-colorable}
   {J. Graph Theory} {84} {2017} {} {408--427}

\objavljenoRevija
% 1.01: %list {\bf 7}. KNOX, Fiachra, MATSUMOTO, Naoki, HERMOSILLO DE LA MAZA, Sebasti\'{a}n Gonz\'{a}lez, MOHAR, Bojan, SALES, Cl\'{a}udia L. Proper orientations of planar bipartite graphs. {\it Graphs Combin.}, 2017, vol. 33, iss. 5, str. 1189-1194. $[$COBISS.SI-ID 18211929$]$\\ 
   {F.~Knox, N.~Matsumoto, S.~G.~Hermosillo de la Maza, \crta, C.~Linhares Sales}
   {Proper orientations of planar bipartite graphs}
   {Graphs Combin.} {33} {2017} {} {1{1}89--1{1}94}

\objavljenoRevija
% 1.01: %list {\bf 12}. LI, Zhentao, MOHAR, Bojan. Planar digraphs of digirth four are 2-colorable. {\it SIAM J. Discrete Math.},  2017, vol. 31, no. 3, str. 2201-2205. $[$COBISS.SI-ID 18189657$]$\\ 
   {Z.~Li, \crta}
   {Planar digraphs of digirth four are 2-colorable}
   {SIAM J. Discrete Math.} {31} {2017} {} {2{2}01--2{2}05}

\objavljenoRevija
% 1.01: %list {\bf 3}. MOHAR, Bojan, REED, Bruce, WOOD, David Richard. Colourings with bounded monochromatic components in graphs of given circumference.  {\it Australas.\ J. Combin.},  2017, vol. 69, part 2, str. 236-242.  $[$COBISS.SI-ID 18212185$]$\\ 
   {\crta, B.~Reed, D. R.~Wood}
   {Colourings with bounded monochromatic components in graphs of given circumference}
   {Australas.\ J. Combin.} {69} {2017} {} {236--242}

\objavljenoRevija
% 1.01: %list {\bf 6}. MOHAR, Bojan, \v{S}KODA, Petr. Obstructions for two-vertex alternating embeddings of graphs in surfaces.  {\it European J. Combin.}, 2017, vol. 59, str. 96-113. $[$COBISS.SI-ID 17761369$]$\\ 
   {\crta, P.~\v{S}koda}
   {Obstructions for two-vertex alternating embeddings of graphs in surfaces}
   {European J. Combin.} {59} {2017} {} {96--1{1}3}

\objavljenoRevija
% 1.01: %list {\bf 4}. REZAEI, Seyed Saeed Changiz, HOSSEINI, Seyyed Aliasghar, MOHAR, Bojan. Almost all regular graphs are normal.  {\it Discrete Appl.\ Math.},  2017, vol. 230, str. 51-55. $[$COBISS.SI-ID 18213465$]$\\ 
   {S.~.~C.~Rezaei, S.~A.~Hosseini, \crta}
   {Almost all regular graphs are normal}
   {Discrete Appl.\ Math.} {230} {2017} {} {51--5{5}}

\end{skupina} 

%--------------------------------------------------------
%  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}

\end{skupina}

%--------------------------------------------------------
%  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}
   {Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2017)}
   {Goa} {Indija} {februar} {2017}

\organizacija
   {�lan organizacijskega odbora}
   {Geometric and Structural \break Graph Theory}
   {Banff} {Kanada} {avgust} {2017}

\end{skupina}


%--------------------------------------------------------
%  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} 

\predavanjeKonferenca
   {Odd trails and totally odd immersions in graphs}
   {vabljeno predavanje}
   {Workshop on Structural Graph Theory and Discrete Optimization}
   {Sanya}{Kitajska}{maj}{2017}

\predavanjeUstanova
   {Odd trails in graphs and totally odd immersions}
   {kolokvijsko predavanje}
   {Warwick University}
   {Warwick} {Velika Britanija} {maj} {2017}

\predavanjeKonferenca
   {Totally odd immersions of graphs}
   {vabljeno predavanje}
   {CanaDAM 2017}
   {Toronto}{Kanada}{junij}{2017}

\predavanjeKonferenca
% 1.10: {\bf 14}. MOHAR, Bojan, KNOX, Fiachra. Maximizing the number of colorings. V: 17th Workshop on Graph Theory: Colourings, Independence and Domination, September 17-22, 2017, Piechowice, Poland. {\it CID : colourings, independence and domination : abstracts}}. $[$Zielona G\'{o}ra: Uniwersytet Zielonog\'{o}rski$]$, 2017, str. 77.  $[$COBISS.SI-ID 18127449$]$\\ 
   {Maximizing the number of colorings}
   {vabljeno plenarno predavanje}
   {17\uth Workshop on Graph Theory: Colourings, Independence and Domination}
   {Zielona G\'{o}ra} {Poljska} {september} {2017} 

\predavanjeKonferenca
   {Ramanujan gap for the norm of adjacency operators}
   {vabljeno predavanje}
   {Discrete and Continuous Models in the Theory of Networks}
   {Bielefeld}{Nem\v cija}{november}{2017}

\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
% 1.08: {\bf 13}. DVO\v{R}\'{A}K, Zden\v{e}k, KR\'{A}L', Daniel, MOHAR, Bojan. Graphic TSP in cubic graphs. V: VOLLMER, Heribert (ur.), VALL\'{E}E, Brigitte (ur.). {\it 34th Symposium on Theoretical Aspects of Computer Science : STACS 2017, March 8-11, 2017, Hannover, Germany}}, (Leibniz international proceedings in informatics, ISSN 1868-8969, 66). Saarbr\"{u}cken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum f\"{u}r Informatik GmbH, Dagstuhl Publishing, March 2017, 13 str. $[$COBISS.SI-ID 18215001$]$\\ 
%POZOR: Bibliografija2017.tex > 2017\mat\clani\mohar.tex 6399/246: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2017.tex > 2017\mat\clani\mohar.tex 6399/247: Ne najdem podatka {LETO}
%   {Graphic TSP in cubic graphs}
%   {34\uth Symposium on Theoretical Aspects of Computer Science}
%  {Hannover} {Nem�ija} {marec} {2017}


%\end{skupina} 

%--------------------------------------------------------
%  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} 

%\begin{skupina}{I}
%POZOR: Bibliografija2017.tex > 2017\mat\clani\mohar.tex 6478/288: Stevilo neopredeljenih zadetkov: 9

%%\razno
%% 1.10: {\bf 14}. MOHAR, Bojan, KNOX, Fiachra. Maximizing the number of colorings. V: 17th Workshop on Graph Theory: Colourings, Independence and Domination, September 17-22, 2017, Piechowice, Poland. {\it CID : colourings, independence and domination : abstracts}}. $[$Zielona G\'{o}ra: Uniwersytet Zielonog\'{o}rski$]$, 2017, str. 77.  $[$COBISS.SI-ID 18127449$]$\\ 

%\razno
% 1.25: {\bf 15}. BOKAL, Drago, MOHAR, Bojan, \v{S}IRAN, Jozef. Dan Archdeacon (11 May 1954 to 18 February 2015). {\it Ars Math.\ Contemp.}, ISSN 1855-3966. $[$Tiskana izd.$]$, 2017, vol. 12, no. 1, str. IX. $[$COBISS.SI-ID 18099545$]$\\ 

%\razno
% Ured: {\bf 16}. {\it Discrete \& computational geometry}. Mohar, Bojan (\v{c}lan uredni\v{s}kega odbora 2013-). New York; Berlin; Heidelberg; Tokyo: Springer, 1986-. ISSN 0179-5376.  $[$COBISS.SI-ID 25342208$]$\\ 

%\razno
% Ured: %list {\bf 17}. {\it Discrete mathematics}. Mohar, Bojan (podro\v{c}ni urednik 2007-). $[$Print ed.$]$. Amsterdam: North-Holland, 1971-. ISSN 0012-365X. $[$COBISS.SI-ID 1118479$]$\\ 

%\razno
% Ured: %list {\bf 18}. {\it Electron.\ J. Combin.}. Mohar, Bojan (glavni urednik 2013-). $[$Online ed.$]$. Atlanta, Ga.: N.J. Calkin and H.S. Wilf, 1994-. ISSN 1077-8926. $[$COBISS.SI-ID 6973785$]$\\ 

%\razno
% Ured: %list {\bf 19}. {\it J. Combin.\ Theory Ser.\ B}. Mohar, Bojan (glavni urednik 2015-). Duluth, Minn.: Academic Press, 1971-. ISSN 0095-8956.  $[$COBISS.SI-ID 25721600$]$\\ 

%\razno
% Ured: %list {\bf 20}. {\it J. Graph Theory}. Mohar, Bojan (\v{c}lan uredni\v{s}kega odbora 2012-). New York: J. Wiley \& Sons, 1977-. ISSN 0364-9024. $[$COBISS.SI-ID 25747712$]$\\ 

%\razno
% Ured: %list {\bf 21}. {\it MATCH Communications in Mathematical and in Computer Chemistry}. Mohar, Bojan (\v{c}lan uredni\v{s}kega odbora 2002-). Kragujevac: University of Kragujevac: Faculty of Science Kragujevac, 1975-. ISSN 0340-6253. $[$COBISS.SI-ID 2624551$]$\\ 

%\razno
% Ured: %list {\bf 22}. {\it Tbilisi Mathematical Journal}. Mohar, Bojan (\v{c}lan uredni\v{s}kega odbora 2015-). Tbilisi: TCMS, 2008-. ISSN 1512-0139. $[$COBISS.SI-ID 17758041$]$\\ 

%\end{skupina} 

%--------------------------------------------------------
%  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} 

