Home Whole BibTeX file
As of now, I try and submit papers only to journals that are free or published by a public institution or a knowledge society (such as SIAM and ACM).

Do triangle-free planar graphs have an exponential number of 3-colorings?(PDFJournalBibTeX)
(With Z. Dvořák)
The Electronic Journal of Combinatorics, 24(3):#P3.47, 27pp., 2017.

Equitable Colorings of K_4-minor-free Graphs(PDFJournalBibTeX)
(With R. de Joannis de Verclos)
Journal of Graph Algorithms and Applications, 21(6):1091--1105, 2017.

Expander graphs and sieving in combinatorial structures(PDFJournalBibTeX)
(With F. Jouve)
Journal of the Australian Mathematical Society, forthcoming.

A note on acyclic vertex-colorings(PDFJournalBibTeX)
(With J. Volec)
Journal of Combinatorics, 7(4):725--737, 2016.

Closeness centralization measure for two-mode data of prescribed sizes(PDFJournalBibTeX)
(With M. Krnc, R. Škrekovski and Z. B. Yilma)
Network Science, 4(4): 474--490, 2016.

Fractional coloring of triangle-free planar graphs(PDFJournalBibTeX)
(With Z. Dvořák and J. Volec)
The Electronic Journal of Combinatorics, 22(4):#P4.11, 7pp., 2015.

Two-floor building needing eight colors(PDFJournalBibTeX)
(With S. Bessy and D. Gonçalves)
Journal of Graph Algorithms and Applications, 19:1--9, 2015.

Extensions of fractional precolorings show discontinuous behavior(PDFJournalBibTeX)
(With J. van den Heuvel, D. Král', M. Kupec and J. Volec)
Journal of Graph Theory, 77:299--329, 2014.

Subcubic triangle-free graphs have fractional chromatic number at most 14/5(PDFJournalBibTeX)
(With Z. Dvořák and J. Volec)
Journal of the London Mathematical Society, 89(3):641--662, 2014.

Supersaturation in the Boolean lattice(PDFJournalBibTeX)
(With A. P. Dove, J. R. Griggs and R. J. Kang)
Integers, 14A:A4 (The Dick deBruijn Memorial Issue), 2014.

Transversals of longest paths and cycles(PDFJournalBibTeX)
(With D. Rautenbach)
SIAM Journal on Discrete Mathematics, 28(1):335--341, 2014.

A new bound for the 2/3 conjecture(PDFJournalBibTeX)
(With D. Král', C.-H. Liu, P. Whalen and Z. B. Yilma)
Combinatorics, Probability and Computing, 22(3):384--393, 2013.

A tight bound on the set chromatic number(PDFJournalBibTeX)
(With Z. B. Yilma)
Discussiones Mathematicae Graph Theory, 33(2):461--465, 2013.

Multiple Petersen subdivisions in permutation graphs(PDFJournalBibTeX)
(With T. Kaiser and Z. B. Yilma)
The Electronic Journal of Combinatorics, 20:#P11, 9pp., 2013.

Toward more Localized Local Algorithms: Removing Assumptions concerning Global Knowledge(PDFJournalBibTeX)
(With A. Korman and L. Viennot)
Distributed Computing, 26(5-6):289--308, 2013.

A new lower bound based on Gromov’s method of selecting heavily covered points(PDFJournalBibTeX)
(With D. Král' and L. Mach)
Discrete and Computational Geometry, 48(2):487--498, 2012.

Griggs and Yeh's Conjecture and L(p,1)-labelings(PDFJournalBibTeX)
(With F. Havet and B. Reed)
SIAM Journal on Discrete Mathematics, 26(1):145--168, 2012.

Min-max relations for odd cycles in planar graphs(PDFJournalBibTeX)
(With D. Král' and L. Stacho)
SIAM Journal on Discrete Mathematics, 26(3):884--895, 2012.

Characterization of graphs and digraphs with small process number(PDFJournalBibTeX)
(With D. Coudert)
Discrete Applied Mathematics, 159(11):1094--1109, 2011.

Edge-face colouring of plane graphs with maximum degree nine(PDFJournalBibTeX)
(With M. Stehlík)
Journal of Graph Theory, 66(4):332--346, 2011.

Every plane graph of maximum degree 8 has an edge-face 9-colouring(PDF z5p9 Nx9rnal">Journal of Graph Theory, 77:299--329, 2014.T. Kais9uadoz/mainenoble-inp.fr/~stehlikcho)
25 51br 533 Journal of Graph Theory, 66(4):332--346, 2011. oz/main

G f>) a laneic

(PDFBibTeX)
of Graph Theory, 77:299--u29, 20Muell 299-/ilei

A new bound for theP&oeceda/r>PDF — Z. B. Yilma) 18 18< Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/main

~zyi0, 2016.
(PDFJou. oz/maioz/main="Bib_Files/SeYi13.bib">BibTeX)
z/mainof Graph Theory, 77:
ns="b P.

Jou. oz/maioz/main="Bib_Files/r/~stehlikoudert/">D. Coudert Lettttp:/2ilma<4> Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/main

coming. flow

A new bound for the

(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinof Graph Theory,pan>
(With

A new bound for the h Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/r/~stehlikEurop Yilma) 31enbac20 4 0 Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiin, 7(4):725--737p> result> SteineX fr2013.syste //dx.doi.org/10.1016/j.dam.2011.03.010">Jou. oz/maioz/maiiiiiiiiiiiii. Cir a l veckquo sSteh2014.<

A new bound for the

Confcmsam=maina/cgi- /vaultp://aprepub/(WitJ7103.prepubPDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTanof Graph Theory, 77 (With h E. M& čajov& mp;DRC=./STRUCTURE/02_pracovnici/000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 of Graph Theory, 77:wk.php">299-/ilei PDF Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiin

Circulareckquo sSteh2014.< gir ix

(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiii)
(With h E. M& čajov& mp;DRC=./STRUCTURE/02_pracovnici/00000000000000000000000000000000000000000000000000000000000000 aduatMaz k Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/index.html.en">J. Volec58 0 Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiinf Combinatorics, 24(3):#pan> rs

ge-face 9-colouring(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiR. Luo, Cci/00ph_Fil G. Yu— Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/awi/mawi-or/mitarbeiter/drautenbach.html">D. Rauilma<1572--1583 0 Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiin 4(4): 474--490aci s us Hall'slte;k

(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii (W (With h Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/awi/mawi-Europ Yilma) 31e3pan>0an><019 0 Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinonal Geometry, 4 an> ed tree-wid large -gir the allockqbipef="t

Edge-face colouring 1p55/8A noteK SS 0th maximum degree nine(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinp;nick=ToKai&kam=maiuiu.edu/pekockochk (With Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/index.html.en">J. Volec Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinonal Geometry,O xtet polynomitml.enfull&a016.

1e graphs w0th maximum degree nine((PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin.php?KMAfile=./CLENOVE/main.php&DRC=./STRUCTURE/02_pracovnici/001_abeceda/&DRL=EN&DROF=0&nick=ToKai&kam=main1.php">T. Kais9uadoz/mai z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/index.html.en/a>) C) f="h 7e3pan12an> Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiins, 20:#P11, 9pp Filt

(PDFPDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin>BibTeX)(With h Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/awi/mawi-or/mitarbeiter/drautenbach.html">D. Rauil2):6 707 0 Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin4):#P4.11, 7pp., span> arbei (PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinof Graph Theory, 77: (With N ardopolJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/a.fr/sloop/David.Ch.html">D. Ra310e3pa557r 560 0 (SpecKang) devo://gto.bibspan class="coauthors">(With Sixth Czech-Slovak ef="r/s

Symposi r/dCGTAA 06.) Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin6(5-6):289--308an>tna B improp r Every plane graph of maxi49r86m dee 8 CHS09.h maximum degree nine
uqedu/.au/?LENO=get_volumes?KMAfvolume=4(PDFJou.
oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinof Graph Theory, 77: (WJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/a.fr/sloordeaux.asi Yilma) 43:21 230 09. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin6(5-6):289--308, 2013. > n

(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinof Graph Theory, 77 (With h Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/awi/mawi-or/mitarbeiter/drautenbach.html">D. Rau3e3pan46 483 09. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin6(5-6):289--308,stepgto, 201bib"Bermond-Th sn> saan>tndisj> of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii

A noteLPS09.h maximum degree nine(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTaN ardopoli 299-/ilei PDFD. Rau3e2):97 992 09. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin6(5-6):289--30 Circularof Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiChoos
(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii (W Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/index.html.enlík)1lma<2 Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin 4(4): 474--490ull&a016< h exponentially many

fr.ations for oddh801.1438v2aximum degree nine(PDFPDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin>BibTeX)(With h Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/index.html.en/a>) C) f="h 6 43--447 09. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin 4(4): 474--49Identify lo ng-dom cod (r om) gbr /> icof Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinetwork

(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii of Graph Theory, 77:299--u29, 20Muell Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/r/~stehliC Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin

Improp r l.enunitndisk< Characteriza15/06/2 oe 8 RR-6206.h maximum degree nine(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii (WeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/r/~stehliNetwork , 54e3pan50 4 09. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin Lo c full&a016<

A new lower bound bah801.3854v2aximum degree nine(PDFPDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinof Graph Theory, 77 (With h O. Bi c (WeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/index.html.en/a>) C) f="h 5lma<102an> Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin Pro ive, coaine, cnd abeli sSteh2014.< s&a01i/Af="htt0297P+08th maximum degree nine(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinof Graph Theory, 77 (With h E. M& čajov& mp;D O. Bi c (W Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/i -Europ Yilma) 30enba53--69 09. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin 3ote>i l.en

(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii (WeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/awi/mawi-or/mitarbeiter/drautenbach.html">D. Rau2enba23/sp247 08. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinonal Geometry, 4 full Bik 3o
(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii of Graph Theory, 77:299--mcgillina/sn E N E — Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/index.html.en">J. Volec Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin 4(4): 474--49Improp r l.en(r om) unitndisk< 77:
s&a01i/Af="htt0297S07th maximum degree nine(
PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii of Graph Theory, 77:299--329, 2014.Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/a.fr/sloop/David.Ch.html">D. Ra308(8pan438 454 08. (SpecKangi/a>) devo://gto.Euro">J. 05.) Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin

Listspan> s measur(3):#sets

(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinof Graph Theory,kam hladk Hladk (W (With h Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/index.html.enlík59e3pa22 238 08. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin Lo lbib"an> aryl.ena termsStehits max orof Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiimin

(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii of Graph Theory, 77:299--u29, 20Muell )
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii 299-/ilei PDFD. Ra308(24):6581--6583 08. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin R omly l (a J. Volec

(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/r/~stehliC p r Science Review l2):63--95 08. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin4):#P4.11, 7pp.ot l.en max nin

(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii of Graph Theory, 77:2 wedu/.p 20kowalik Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/awi/mawi-or/mitarbeiter/drautenbach.html">D. Rau2e4pan462 479 08. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin4):#P4.11, 7ppOrder ten ele are cKrcle order 77:
s&a01i/Af="htt02BLS07ath maximum degree ninePDF — Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTat.uBayr/d (<">N ygeros— Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/a.fr/sloorppliedch.html">D. E-N11, Ra7:16--22 07. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin P.htwidbTa.eno r ar< 77:
s&a01i/Af="htt02CHS07th maximum degree nine(
PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii sloop/David.Couderth Coudertmp;DeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii ascotte/Fn> an.Huc uc— Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/index.html.enlík55enba27--41 07. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin 4(4): 474--49Improp r hoos
77:
s&a01i/Af="htt02HaSe06.h maximum degree nine(PDFJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTeX)
z/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii (WJou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/ucw.cz/index.html.enlík52e3pan81--199 06. Journal of Graph Theory, 66(4):332--346, 2011. oz/maioz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin 4(4): 474--49New pro s enumerationl.enmixed model 77:
s&a01i/Af="htt02BLS05th maximum degree ninePDF — Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/SeYi13.bib">BibTat.uBayr///dx.doi.org/10.1016/j.dam.2011.03.010">Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii (<">N ygeros— Jou. oz/maioz/maiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiin="Bib_Files/a.fr/sloorppliedch.html">D. E-N11, Ra5:60--65, 05. Journal of Graph Theo