\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
   {Ararat Harutyunyan, P. Mark Kayll, \crta, Liam Rafferty}
   {Uniquely $D$-colourable digraphs with large girth}
   {Canad.\ J. Math.}

\sprejetoRevija
   {\crta, G. Simonyi, G. Tardos}
   {Local chromatic number of quadrangulations of surfaces}
   {Combinatorica}

\sprejetoRevija
   {Z. Dvo\v r\'ak, \crta}
   {Chromatic number and complete graph substructures for degree sequences}
   {Combinatorica}

\sprejetoRevija
   {K.-i.~Kawarabayashi, S. Kreutzer, \crta}
   {Linkless and flat embeddings in 3-space}
   {Discrete Comput.\ Geom.}

\sprejetoRevija
   {A.~Harutyunyan, \crta}
   {Two results on the digraph chromatic number}
   {Discrete Math.}

\sprejetoRevija
   {M.~DeVos, J~.McDonald, \crta, D.~Scheide}
   {Immersing complete digraphs}
   {European J. Combin.}

\sprejetoRevija
   {\crta, S. \v{S}pacapan}
   {Degenerate and star colorings of graphs on surfaces}
   {European J. Combin.}

\sprejetoRevija
   {D.~Kr\'al', \crta, A.~Nakamoto, O.~Pongr\'ac, Y.~Suzuki}
   {Coloring Eulerian triangulations of the Klein bottle}
   {Graphs Combin.}

\sprejetoRevija
   {\crta, P.~�koda}
   {Minimizing the number of label transitions around a nonseparating vertex of a planar graph}
   {J. Graph Algorithms Appl.}

\sprejetoRevija
   {V. P. Korzhik, \crta}
   {Minimal obstructions for 1-immersions and hardness of 1-planarity testing}
   {J. Graph Theory}

\sprejetoRevija
   {J. McDonald, \crta, D. Scheide}
   {Kempe equivalence of edge-colourings in subcubic and subquartic graphs}
   {J. Graph Theory}

\sprejetoRevija
   {Z. Dvo\v r\'ak, \crta, R. \v S\'amal}
   {Star chromatic index}
   {J. Graph Theory}

\sprejetoRevija
   {\crta, A.\,S.~Ahmady, R.\,P.~Singh}
   {Eigenvalues of graphs with vertices of large degree at distance three apart}
   {Linear Algebra Appl.}

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

\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.01: {\bf 1}. CABELLO, Sergio, MOHAR, Bojan. Crossing number and weighted crossing number of near-planar graphs. {\it Algorithmica}, 2011, 
%vol. 60, no. 3, str. 484-504. http://dx.doi.org/10.1007/s00453-009-9357-5. $[$COBISS.SI-ID 15261785$]$\\
   {S.~Cabello, \crta}
   {Crossing number and weighted crossing number of near-planar graphs}
   {Algorithmica} {60} {2011} {3} {484--504}

\objavljenoRevija
% 1.01: %list {\bf 3}. CHAPUY, Guillaume, FUSY, \'{E}ric, GIM\'{E}NEZ, Omer, MOHAR, Bojan, NOY, Marc. Asymptotic enumeration and limit laws for 
%graphs of fixed genus. {\it J. comb. theory. Ser. A}, 2011, vol. 118, iss. 3, str. 748-777. http://dx.doi.org/10.1016/j.jcta.2010.11.014. 
%$[$COBISS.SI-ID 15875673$]$\\
   {G.~Chapuy, \'{E}.~Fusy, O.~Gim\'{e}nez, \crta, M.~Noy}
   {Asymptotic enumeration and limit laws for graphs of fixed genus}
   {J. Combin.\ Theory Ser.\ A} {118} {2011} {3} {748--7{7}7}

\objavljenoRevija
% 1.01: %list {\bf 4}. DEVOS, Matt, MOHAR, Bojan, \v{S}\'{A}MAL, Robert. Unexpected behaviour of crossing sequences. {\it J. comb. theory, Ser. B}, 
%2011, vol. 101, iss. 6, str. 448-463. http://dx.doi.org/10.1016/j.jctb.2010.12.002. $[$COBISS.SI-ID 16051801$]$\\
   {M.~DeVos, \crta, R.~\v{S}\'{a}mal}
   {Unexpected behaviour of crossing sequences}
   {J. Combin.\ Theory Ser.\ B} {101} {2011} {6} {4{4}8--463}

\objavljenoRevija
% 1.01: %list {\bf 6}. HARUTYUNYAN, Ararat, MOHAR, Bojan. Gallai's Theorem for List Coloring of Digraphs. {\it SIAM j. discrete math.}, 2011,
%vol. 25, no. 1, str. 170-180. http://dx.doi.org/10.1137/100803870. $[$COBISS.SI-ID 16037721$]$\\
   {A.~Harutyunyan, \crta}
   {Gallai's Theorem for List Coloring of Digraphs}
   {SIAM J. Discrete Math.} {25} {2011} {1} {170--180}

\objavljenoRevija
% 1.01: %list {\bf 2}. MOHAR, Bojan. 2-cell embeddings with prescribed face lengths and genus. {\it Ann. comb. (Print. ed.)}, 2011, vol. 14, 
%no. 4, str. 525-532. http://dx.doi.org/10.1007/s00026-011-0075-8. $[$COBISS.SI-ID 15867993$]$\\
   {}
   {2-cell embeddings with prescribed face lengths and genus}
   {Ann.\ Comb.} {14} {2011} {4} {525--532}

\objavljenoRevija
% 1.01: %list {\bf 5}. MOHAR, Bojan, VODOPIVEC, Andrej. The genus of Petersen powers. {\it J. graph theory}, 2011, vol. 67, no. 1, str. 1-8. 
%http://dx.doi.org/10.1002/jgt.20507. $[$COBISS.SI-ID 15909209$]$\\
   {\crta, A.~Vodopivec}
   {The genus of Petersen powers}
   {J. Graph Theory} {67} {2011} {1} {1--8}

\objavljenoRevija
   {G.~Chen, Y.~Egawa, K.~Kawarabayashi, \crta, K.~Ota}
   {Toughness of $K_{a,t}$-minor-free graphs}
   {Electron.\ J. Combin.}{18}{2011}{}{P148, 6 str.}

\objavljenoRevija
   {A.~Harutyunyan, \crta}
   {Strengthened Brooks' Theorem for digraphs of girth at least three}
   {Electron.\ J. Combin.}{18}{2011}{}{P195, 11 str.}

%\objavljenoRevija
%   {\crta, S. \v{S}pacapan}
%   {Degenerate and star colorings of graphs on surfaces}
%   {European J. Combin.}{33}{2012}{}{340--349}

\objavljenoZbornik
   {\crta, P. \v{S}koda}
   {On minimizing the number of label transitions around a vertex of a planar graph}
   {IWOCA}
   {Victoria, BC} {Kanada} {junij} {2011}
   {Combinatorial Algorithms, C.S. Iliopoulos and W.F. Smyth (Eds.), LNCS 7056, Springer, 2011} {300--309}
%doi: 10.1007/978-3-642-25011-8_24

\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
   {\v Clan uredni�kega odbora}
   {Linear and Multilinear Algebra}
\urednikRevija
   {\v Clan uredni�kega odbora}
   {Journal of Graph Theory}
\urednikRevija
   {\v Clan uredni�kega odbora}
   {Journal of Combinatorial Theory. Series B}
\urednikRevija
   {\v Clan uredni�kega odbora}
   {MATCH. Communications in Mathematical and in Computer Chemistry}
\urednikRevija
   {Podro\v cni urednik}
   {Discrete Mathematics}
\urednikRevija
   {Urednik}
   {SIAM Journal on Discrete Mathematics}
\urednikRevija
   {\v Clan uredni�kega odbora}
   {Ars Mathematica Contemporanea}
\end{skupina}

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

\begin{skupina}{E}


\organizacija
   {�lan znanstvenega odbora (scientific committee)}
   {7\uth Slo\-ve\-ni\-an International Conference on Graph Theory}
   {Bled} {Slovenija} {junij} {2011} 

\organizacija
   {Organizator minisimpozija Spectral Graph Theory}
   {CanaDAM 2011}
   {Victoria, BC} {Kanada} {junij} {2011}

\organizacija
   {\v Clan programskega odbora}
   {European Conference on Combinatorics, Graph Theory and Applications, EuroComb'11}
   {Budimpe\v sta}{Mad\v zarska}{avgust}{2011}

\organizacija
   {\v Clan programskega odbora}
   {ACM-SIAM Symposium on Discrete Algorithms, SODA'12}
   {Kyoto}{Japonska}{januar}{2012}

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

\end{skupina}

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

\begin{skupina}{F}

\predavanjeKonferenca
   {Spectrally degenerate graphs}
   {vabljeno predavanje}
   {Linear Algebraic Techniques in Combinatorics and Graph Theory}
   {Banff, Alberta}{Kanada}{februar}{2011}

\predavanjeKonferenca
   {Immersions in graphs and digraphs}
   {vabljeno plenarno predavanje}
   {4\uth \newline International Conference on Combinatorics, Graph Theory, and Applications}
   {Elgersburg}{Nem\v cija}{marec}{2011}

\predavanjeKonferenca
   {Graph immersions}
   {vabljeno predavanje}
   {Probabilistic and structural graph theory}
   {Bellairs Research Institute}{Barbados}{marec}{2011}

\predavanjeKonferenca
   {On the chromatic number of digraphs}
   {vabljeno plenarno predavanje}
   {KAIST Graph Theory Day 2011}
   {Daejeon}{Koreja}{maj}{2011}

\predavanjeKonferenca
   {Immersions in graphs and digraphs}
   {vabljeno predavanje}
   {\"{O}MG-Tagung - CSASC 2011}
   {Krems} {Avstrija} {september} {2011}
% 1.12: %list {\bf 11}. MOHAR, Bojan. Immersions in graphs and digraphs. V: DRMOTA, Michael (ur.). {\it \"{O}MG-TAGUNG - CSASC 2011 : 
%Joint Mathematical Conference of the Austrian Mathematical Society at the Donau-Universit\"{a}t Krems together with the Catalan, Czech, 
%Slovak and Slovenian Mathematical Societes : September 25-28, 2011}. Wien: \"{O}sterreichische Mathematische Gesellschaft, cop. 2011, str. 56. 
%$[$COBISS.SI-ID 16041049$]$\\

\predavanjeKonferenca
   {Large clique minors in vertex transitive graphs}
   {vabljeno predavanje}
   {Workshop on Symmetry in Graphs, Maps, and Polytopes}
   {Toronto}{Kanada}{oktober}{2011}

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

\end{skupina}

%--------------------------------------------------------
%  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.12: %list {\bf 8}. DVORAK, Zdenek, LIDICK\'{Y}, Bernard, MOHAR, Bojan. 5-choosability of graphs with crossings far apart. V: KUTNAR, 
%Klavdija (ur.), \v{S}PARL, Primo\v{z} (ur.), KUZMAN, Bo\v{s}tjan (ur.). {\it Abstracts of the 7th Slovenian international conference on graph 
%theory, Bled, Slovenia, 19-25 June 2011}. Koper: UP FAMNIT: UP PINT, 2011, str. 68. http://osebje.famnit.upr.si/\~{}bled.2011/Bled11-Abstracts.pdf. 
%$[$COBISS.SI-ID 15958361$]$\\
%POZOR: Bibliografija2011.tex > 2011\mat\clani\mohar.tex 10146/191: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2011.tex > 2011\mat\clani\mohar.tex 10146/192: Ne najdem podatka {LETO}
   {5-choosability of graphs with crossings far apart}
   {7\uth Slo\-ve\-ni\-an In\-ter\-na\-ti\-o\-nal Conference on Graph Theory}
   {Bled} {Slovenija} {junij} {2011}

\konferenca
% 1.12: %list {\bf 9}. MOHAR, Bojan, HARUTYUNYAN, Ararat. On the chromatic number of digraphs. V: KUTNAR, Klavdija (ur.), \v{S}PARL, 
%Primo\v{z} (ur.), KUZMAN, Bo\v{s}tjan (ur.). {\it Abstracts of the 7th Slovenian international conference on graph theory, Bled, Slovenia, 
%19-25 June 2011}. Koper: UP FAMNIT: UP PINT, 2011, str. 70. http://osebje.famnit.upr.si/\~{}bled.2011/Bled11-Abstracts.pdf. 
%$[$COBISS.SI-ID 15959129$]$\\
%POZOR: Bibliografija2011.tex > 2011\mat\clani\mohar.tex 10156/227: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2011.tex > 2011\mat\clani\mohar.tex 10156/228: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2011.tex > 2011\mat\clani\mohar.tex 10156/229: Ne najdem podatka {LETO}
   {On the chromatic number of digraphs}
   {7\uth Slo\-ve\-ni\-an In\-ter\-na\-ti\-o\-nal Conference on Graph Theory}
   {Bled} {Slovenija} {junij} {2011}

\konferenca
% 1.12: {\bf 7}. DVORAK, Zdenek, LIDICK\'{Y}, Bernard, MOHAR, Bojan. 5-choosability of graphs with crossings. V: {\it 25th LL-Seminar on Graph 
%Theory : Montanuniversit\"{a}t Leoben, September 23-24, 2011}. Leoben: Montanuniversit\"{a}t Leoben, 2011, str. 9. $[$COBISS.SI-ID 16045145$]$\\
%POZOR: Bibliografija2011.tex > 2011\mat\clani\mohar.tex 10140/209: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2011.tex > 2011\mat\clani\mohar.tex 10140/210: Ne najdem podatka {LETO}
   {5-choosability of graphs with crossings}
   {25\uth LL-Seminar on Graph Theory}
   {Leoben} {Avstrija} {september} {2011}

\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: Bibliografija2011.tex > 2011\mat\clani\mohar.tex 10222/270: Stevilo neopredeljenih zadetkov: 6
%\razno
% Ured: {\bf 12}. {\it Ars mathematica contemporanea}. Mohar, Bojan (\v{c}lan uredni\v{s}kega odbora 2008-). $[$Tiskana izd.$]$. 
%Ljubljana: Dru\v{s}tvo matematikov, fizikov in astronomov, 2008-. ISSN 1855-3966. http://amc.imfm.si/index.php/amc. 
%$[$COBISS.SI-ID 239049984$]$\\

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

%\razno
% Ured: %list {\bf 14}. {\it Journal of combinatorial theory. Series B}. Mohar, Bojan (\v{c}lan uredni\v{s}kega odbora 2000-). Duluth, Minn.: Academic Press, 1971-. ISSN 0095-8956. $[$COBISS.SI-ID 25721600$]$\\

%\razno
% Ured: %list {\bf 15}. {\it Journal of graph theory}. Mohar, Bojan (glavni urednik 2004-). New York: John Wiley, 1977-. ISSN 0364-9024. $[$COBISS.SI-ID 25747712$]$\\

%\razno
% Ured: %list {\bf 16}. {\it Linear \& multilinear algebra}. Mohar, Bojan (\v{c}lan uredni\v{s}kega odbora 2005-). New York: Gordon and Breach, 1973-. ISSN 0308-1087. $[$COBISS.SI-ID 25872128$]$\\

%\razno
% Ured: %list {\bf 17}. {\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. http://www.pmf.kg.ac.rs/match/. $[$COBISS.SI-ID 2624551$]$\\

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

