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


%POZOR:   Podatke razvrstite ali v sprejetoRevija ali v sprejetoZbornik

\begin{skupina}{B}

\sprejetoRevija
  {K.-I.~Kawarabayashi, \crta}
  {Some recent progress and applications in graph minor theory}
  {Graphs Combin.}
  
\sprejetoRevija
  {}
  {On the Laplacian coefficients of acyclic graphs}
  {Linear Algebra Appl.}
    
\sprejetoRevija
  {M.~Juvan, J.~Marin\v{c}ek, \crta}
  {Obstructions for simple embeddings}
  {Australas.\ J. Combin.}
  
\sprejetoRevija
  {K.-I.~Kawarabayashi, \crta}
  {A relaxed Hadwiger's Conjecture for list colorings},
  {J. Combin.\ Theory Ser.\ B}
  
\sprejetoRevija
  {P. Bella, D. Kr\'al', \crta, K. Quittnerov\'a}
  {Labeling planar graphs with a condition at distance two}
  {European J. Combin.}
  
\sprejetoRevija
  {M. Devos, J. Ebrahimi, M. Ghebleh, L. Goddyn, \crta, R. Naserasr}
  {Circular colouring the plane}
  {SIAM J. Discrete Math.}
  
\sprejetoZbornik
{}
{The Four-Color Theorem}
{Princeton Companion} 
{Princeton} {ZDA} {} {2006}
\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}

\objavljenoRevija
% 1.01: %list {\bf 4}. ALBERTSON, Michael O., MOHAR, Bojan. Coloring vertices and faces of locally planar graphs. {\it Graphs comb.}, 2006, vol. 22, no. 3, str. 289-295. http://dx.doi.org/10.1007/s00373-006-0653-4. $[$COBISS.SI-ID 14168921$]$\\ 
   {M.~O.~Albertson, \crta}
   {Coloring vertices and faces of locally planar graphs}
   {Graphs Combin.} {22} {2006} {3} {289--295}

\objavljenoRevija
% 1.01: %list {\bf 7}. BOKAL, Drago, FIJAV\v{Z}, Ga\v{s}per, MOHAR, Bojan. The minor crossing number. {\it SIAM j. discrete math.}, 2006, vol. 20, no. 2, str. 344-356. http://dx.doi.org/10.1137/05062706X. $[$COBISS.SI-ID 14124633$]$\\ 
   {D.~Bokal, G.~Fijav\v{z}, \crta}
   {The minor crossing number}
   {SIAM J. Discrete Math.} {20} {2006} {2} {34{4}--356}

\objavljenoRevija
% 1.01: %list {\bf 5}. CABELLO, Sergio, DEVOS, Matt, MOHAR, Bojan. Expected case for projecting points. {\it Informatica (Ljublj.)}, 2006, vol. 30, no. 3, str. 289-293. http://ai.ijs.si/informatica/. $[$COBISS.SI-ID 20378919$]$\\ 
   {S.~Cabello, M.~Devos, \crta}
   {Expected case for projecting points}
   {Informatica (Ljublj.)} {30} {2006} {3} {289--293}

\objavljenoZbornik
% 1.08: {\bf 11}. KAWARABAYASHI, Ken-ichi, MOHAR, Bojan. Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. V: {\it STOC'06 : proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, Washington, USA, May 21-23, 2006}. New York: ACM Press, 2006, str. 401-416. http://doi.acm.org/10.1145/1132516.1132576. $[$COBISS.SI-ID 14128473$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\mohar.tex 716/103: Ne najdem podatka {DRZAVA}
%POZOR: bibliografije.tex > 2006\mat\clani\mohar.tex 716/104: Ne najdem podatka {ZBORNIK}
   {K.~Kawarabayashi, \crta}
   {Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs}
   {STOC'06}
   {New York} {ZDA} {maj} {2006}
   {Proc.\ 38th Ann.\ ACM Symp.\ on Theory of Computing, 
    Seattle, Washington, USA, May 21--23, 2006} {401--416} 

\objavljenoRevija
% 1.01: %list {\bf 3}. MOHAR, Bojan. Bar-magnet polyhedra and NS-orientations of maps. {\it Discrete comput. geom.}, 2006, vol. 35, no. 3, str. 482-491. http://dx.doi.org/10.1007/s00454-005-1223-x. $[$COBISS.SI-ID 13920857$]$\\ 
   {}
   {Bar-magnet polyhedra and NS-orientations of maps}
   {Discrete Comput.\ Geom.} {35} {2006} {3} {482--491}

\objavljenoZbornik
% 1.16: {\bf 14}. MOHAR, Bojan. Quadrangulations and 5-critical graphs on the projective plane. V: KLAZAR, Martin (ur.). {\it Topics in discrete mathematics : dedicated to Jarik Ne\v{s}et\v{r}il on the occasion of his 60th birthday}, (Algorithms and combinatorics, Vol. 26). Berlin; Heidelberg; New York: Springer, 2006, str. 565-580. $[$COBISS.SI-ID 14127705$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\mohar.tex 749/120: Ne najdem podatka {DRZAVA}
%POZOR: bibliografije.tex > 2006\mat\clani\mohar.tex 749/121: Ne najdem podatka {ZBORNIK}
   {}
   {Quadrangulations and 5-critical graphs on the projective plane}
   {Topics in discrete mathematics}
   {Berlin; Heidelberg; New York} {Nem\v cija} {januar} {2006}
   {Springer} {565--580} 

\objavljenoRevija
% 1.01: %list {\bf 6}. MOHAR, Bojan. Tree amalgamation of graphs and tessellations of the Cantor sphere. {\it J. comb. theory, Ser. B}, 2006, vol. 96, no. 5, str. 740-753. http://dx.doi.org/10.1016/j.jctb.2006.02.003. $[$COBISS.SI-ID 14127193$]$\\ 
   {}
   {Tree amalgamation of graphs and tessellations of the Cantor sphere}
   {J. Combin.\ Theory Ser.\ B} {96} {2006} {5} {740--753}

\objavljenoRevija
% 1.01: {\bf 1}. MOHAR, Bojan. Universal obstructions for embedding extension problems. {\it Australasian journal of combinatorics}, 2006, vol. 36, str. 39-68. $[$COBISS.SI-ID 14132057$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\mohar.tex 643/137: Ne najdem podatka {STEVILKA}
   {}
   {Universal obstructions for embedding extension problems}
   {Australas.\ J. Combin.} {36} {2006} {} {39--68}

\objavljenoRevija
% 1.01: %list {\bf 2}. MOHAR, Bojan, VODOPIVEC, Andrej. On polyhedral embeddings of cubic graphs. {\it Comb. probab. comput.}, 2006, vol. 15, no. 6, str. 877-893. http://dx.doi.org/10.1017/S0963548306007607. $[$COBISS.SI-ID 14168665$]$\\ 
   {\crta, A.~Vodopivec}
   {On polyhedral embeddings of cubic graphs}
   {Combin.\ Probab.\ Comput.} {15} {2006} {6} {877--893}

\objavljenoRevija
   {}
   {What is ... a graph minor}
   {Notices Amer.\ Math.\ Soc.} {53} {2006} {3} {338--339}

\objavljenoRevija
   {}
   {On the crossing number of almost planar graphs}
   {Informatica (Ljublj.)} {30} {2006} {3} {301--303}

\objavljenoZbornik
   {}
   {Kempe equivalence of colorings}
   {A conference on Graph Theory in memory of Claude Berge}
   {Pariz} {Francija} {julij} {2004}
   {Proceedings} {287--297}
   
\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} 

%    Ni podatkov za to sekcijo
%--------------------------------------------------------
%  D. urednistvo v znanstvenih revijah in zbornikih
%     znanstvenih konferenc
%--------------------------------------------------------

\begin{skupina}{D}

\urednikRevija
   {�lan uredni�kega odbora}
   {Linear and Multilinear Algebra}

\urednikRevija
   {Urednik}
   {Journal of Graph Theory}

\urednikRevija
   {�lan uredni�kega odbora}
   {Journal of Combinatorial Theory, Series B}

\urednikRevija
   {�lan uredni�kega odbora}
   {{\sc match}.\ Communications in Mathematical and in Computer Chemistry}

\urednikRevija
   {Gostujo�i urednik}
   {Discrete Mathematics, Vol.~308}

\end{skupina}


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

\begin{skupina}{E}

\organizacija
{}
{SIAM Conference on Discrete Mathematics}
{Victoria} {Kanada} {junij} {2006}

\organizacija
{}
{SFU Discrete Math Day at IRMACS}
{Burnaby} {Kanada} {junij} {2006}

\organizacija
{}
{Topological Graph Theory and Crossing Numbers}
{Banff} {Kanada} {oktober} {2006} 

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

\end{skupina} 

%   Ni podatkov za to sekcijo

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

\begin{skupina}{F}

\predavanjeKonferenca
   {Subset and subsequence sums in Abelian groups}
   {vabljeno plenarno predavanje}
   {Combinatorics 2006}
   {Victoria} {Kanada} {maj} {2006}

\predavanjeKonferenca
   {Small separations in vertex-transitive graphs}
   {vabljeno plenarno predavanje}
   {5th Cracow Conference on Graph Theory USTRON '06}
   {Ustron} {Poljska} {september} {2006}

\predavanjeKonferenca
   {Geometric graphs on surfaces}
   {vabljeno predavanje}
   {SIAM Conference on Discrete Mathematics}
   {Victoria} {Kanada} {junij} {2006}

\predavanjeKonferenca
   {How large must the set of subset sums be?}
   {vabljeno plenarno predavanje}
   {Kolloquium \"uber Kombinatorik}
   {Magdeburg} {Nem\v cija} {november} {2006}

\predavanjeKonferenca
   {Small separations in symmetric graphs}
   {vabljeno plenarno predavanje}
   {ACCOTA 2006}
   {Puerto Vallarta} {Mehika} {december} {2006}

\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.08: {\bf 11}. KAWARABAYASHI, Ken-ichi, MOHAR, Bojan. Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. V: {\it STOC'06 : proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, Washington, USA, May 21-23, 2006}. New York: ACM Press, 2006, str. 401-416. http://doi.acm.org/10.1145/1132516.1132576. $[$COBISS.SI-ID 14128473$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\mohar.tex 716/238: Ne najdem podatka {DRZAVA}
   {Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs}
   {STOC'06}
   {New York} {ZDA} {maj} {2006} 


\konferenca
% 1.12: %list {\bf 13}. MOHAR, Bojan, DEVOS, Matt, GHEBLEH, Mohammad, GODDYN, Luis, NASERASR, Reza. Orthogonality graphs, their chromatic properties and free will of elementary particles. V: Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, July 10-15, 2006. {\it Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications : abstracts}, (ITI Series, 292). Praha: Charles University, Institut for Theoretical Computer Science, 2006, str. 91. $[$COBISS.SI-ID 14046297$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\mohar.tex 734/255: Ne najdem podatka {DRZAVA}
%POZOR: bibliografije.tex > 2006\mat\clani\mohar.tex 734/256: Ne najdem podatka {MESEC}
   {Orthogonality graphs, their chromatic properties and free will of elementary particles}
   {Sixth Czech-Slovak International Symposium on Combinatorics}
   {Praga} {\v Ce\v ska} {julij} {2006} 

\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}
\razno
   {Mentor pri eni doktorski disertaciji}
\razno
   {Somentor pri eni doktorski disertaciji}
\end{skupina} 
