data.bib 143 KB
Newer Older
Zdenek Dvorak's avatar
Zdenek Dvorak committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
@article{catlin,
author={P. A. Catlin},
title={A bound on the chromatic number of a graph},
journal={Discrete Math.},
volume={22},
year=1978,
pages={81--83}
}

@article{hajos,
author={G. Haj\"os},
title={{\"Uber eine konstraktion nicht $n$-farbbarer graphen}},
journal={Wiss. Z. MartinLuther Univ. Halle-Wittenberg Math. Naturwiss. Reihe},
number={10},
year={1961},
pages={116--117}
}
@article{dirac,
author={G.A. Dirac},
title={A property of 4-chromatic graphs and some remarks on critical graphs},
journal={Journal of London Math Society},
volume=27,
year={1952},
pages={85--92}
}

@article{diracsh,
author={G. A. Dirac},
title={Short proof of a map colour theorem},
journal={Can. J. Math.},
volume=9,
year=1957,
pages="225--226"
}

@article{acyc,
  author={O.V. Borodin},
  year=1979,
  title={On acyclic colorings of planar graphs},
  journal={Discrete Mathematics},
  volume=25,
  pages="211--236"
}

@article{dens65,
  author = {O.V. Borodin and  S. G. Hartke and A. O. Ivanova and A. V. Kostochka and D. B. West},
  title = {Circular (5,2)-coloring of sparse graphs},
  journal = {Sib. Elektron. Mat. Izv.},
  volume = 5,
  year = 2008,
  pages = "417--426"}

@inproceedings{plotkin,
  title={Shallow excluded minors and improved graph decompositions},
  author={Plotkin, Serge and Rao, Satish and Smith, Warren D},
  booktitle={Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms},
  pages={462--470},
  year={1994},
  organization={Society for Industrial and Applied Mathematics}
}

@article{zhusurvey1,
title = "Circular chromatic number: a survey",
journal = "Discrete Mathematics ",
volume = "229",
number = "1-3",
pages = "371--410",
year = "2001",
author = {Zhu, Xuding},
}

@incollection{zhusurvey2,
  title={Recent developments in circular colouring of graphs},
  author={Zhu, Xuding},
  booktitle={Topics in discrete mathematics},
  pages={497--550},
  year={2006},
  publisher={Springer}
}

@article{zhucirc,
  title={Circular chromatic number of planar graphs of large odd girth},
  author={Zhu, Xuding},
  journal={Electronic J. of Combinatorics},
  volume={8},
  pages={R25},
  year={2001}
}

@article{CR16,
  title={Planar graphs have independence ratio at least $3/13$},
  author={D. W. Cranston and L. Rabern},
  journal={Electronic J. of Combinatorics},
  volume={23},
  pages={P3.45},
  year={2016}
}

@article{bkkw,
  title={Homomorphisms from sparse graphs with large girth},
  author={Borodin, Oleg and Kim, S-J. and Kostochka, Alexandr and West, Douglas},
  journal={Journal of Combinatorial Theory, Series B},
  volume={90},
  number={1},
  pages={147--159},
  year={2004}
}

@article{vince,
author = {Vince, A.},
title = {Star chromatic number},
journal = {Journal of Graph Theory},
volume = {12},
number = {4},
pages = {551--559},
year = {1988}
}

@inproceedings{jaeger,
  title={On circular flows in graphs},
  author={F. Jaeger},
  booktitle={Finite and Infinite Sets (Eger, 1981), Colloq. Math. Soc. J. Bolyai},
  volume={37},
  pages={391--402},
  year={1984}
}

@article{matopriv,
author = {Matou\v{s}ek, J. and P\v{r}{\'\i}v\v{e}tiv\'y, A.},
title = {Large Monochromatic Components in Two-Colored Grids},
journal = {SIAM Journal on Discrete Mathematics},
volume = {22},
pages = {295--311},
year = {2008}
}

@incollection{dmnich,
  title={Large independent sets in triangle-free planar graphs},
  author={Dvo{\v{r}}{\'a}k, Zden{\v{e}}k and Mnich, Matthias},
  booktitle={Algorithms-ESA 2014},
  pages={346--357},
  year=2014,
  publisher={Springer}
}

@article{berkos,
  author="A. Bernshteyn and A. Kostochka",
  title="Sharp {D}irac's Theorem for {DP}-critical graphs",
  journal={arXiv},
  volume={1609.09122},
  year=2016
}

@article{berkospron,
  author="A. Bernshteyn and A. Kostochka and S. Pron",
  title="On {DP}-coloring of graphs and multigraphs",
  journal="Sib. Mat. Zhurnal",
  year=2016,
  note="In Russian, to appear. English version: arXiv:1609.00763"
}

@article{dmnichfull,
  title={Large independent sets in triangle-free planar graphs},
  author={Dvo{\v{r}}{\'a}k, Zden{\v{e}}k and Mnich, Matthias},
  journal={SIAM J. Discrete Math.},
  volume=31,
  pages={1355--1373},
  year=2017
}

@article{MW,
author = {Marx, D. and Wollan, P.},
title = {Immersions in Highly Edge Connected Graphs},
journal = {SIAM Journal on Discrete Mathematics},
volume = {28},
number = {1},
pages = {503-520},
year = {2014}
}


@misc{mat,
author = {J. Matou{\v{s}}ek and J. Vondr{\'a}k},
title = "The probabilistic method",
note="Lecture notes",
howpublished={\url{http://kam.mff.cuni.cz/~matousek/lectnotes.html}}
}

@article{jiang,
  author = {T. Jiang},
  title={Compact topological minors in graphs},
  journal={J. Graph Theory},
  volume=67,
  year=2011,
  pages={139--152}}

@article{fracsub,
  author    = {Zdenek Dvo\v{r}\'ak and Jean-S{\'e}bastien Sereni and Jan Volec},
  title     = {Subcubic triangle-free graphs have fractional chromatic number at most 14/5},
  journal = {Journal of the London Mathematical Society},
  volume    = 89,
  year      = 2014,
  pages     = "641--662"
}

@article{frpltr, 
  author    = {Zdenek Dvo\v{r}\'ak and Jean-S{\'e}bastien Sereni and Jan Volec},
  title = {Fractional coloring of triangle-free planar graphs},
  journal = {Electronic Journal of Combinatorics},
  volume = 22,
  year = 2015,
  pages = "P4.11"
}

@article{planfr5,
  author = {A. Hilton and R. Rado and S. Scott},
  title = {A $(<5)$-Colour Theorem for Planar Graphs},
  journal = {Bull. London Math. Soc.},
  volume=5,
  pages="302--306",
  year=1973}

@incollection{Jones1985,
    AUTHOR = {Jones, Kathryn Fraughnaugh},
     TITLE = {Minimum independence graphs with maximum degree four},
 BOOKTITLE = {Graphs and applications ({B}oulder, {C}olo., 1982)},
    SERIES = {Wiley-Intersci. Publ.},
     PAGES = {221--230},
      YEAR = {1985},
PUBLISHER = {Wiley}
}

@article{submany,
title = "Sub-exponentially many 3-colorings of triangle-free planar graphs",
journal={J. Combin. Theory, Ser.~B},
volume = "103",
pages = "706--712",
year = "2013",
author = "A. Asadi and Z. Dvo{\v{r}}{\'a}k and L. Postle and R. Thomas"
}

@article{thom-many,
  author={C. Thomassen},
  title={Many $3$-colorings of triangle-free planar graphs},
  journal={J. Combin. Theory, Ser.~B},
  volume=97,
  year=2007,
  pages="334--349"
}

@article{BorIrred,
  author={O. V. Borodin},
  title={Irreducible graphs in the {G}r\"unbaum-Havel 3-colour problem},
  journal={Discrete Math.},
  volume=159,
  year=1996,
  pages={247--249}
}

@article{PosThoHyperb,
  title={Hyperbolic families and coloring graphs on surfaces},
  author={Postle, Luke and Thomas, Robin},
  journal={Transactions of the American Mathematical Society, Series B},
  volume=5,
  pages={167--221},
  year=2018
}

@inproceedings{crossalg,
  author    = {Markus Chimani and
               Petra Mutzel and
               Immanuel M. Bomze},
  title     = {A New Approach to Exact Crossing Minimization},
  booktitle = {ESA},
  year      = {2008},
  pages     = {284-296},
  crossref  = {DBLP:conf/esa/2008}
}
@proceedings{DBLP:conf/esa/2008,
  editor    = {Dan Halperin and
               Kurt Mehlhorn},
  title     = {Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe,
               Germany, September 15-17, 2008. Proceedings},
  booktitle = {ESA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5193},
  year      = {2008}
}

@article{confluent,
 author = {Chen, Jiangzhuo and Kleinberg, Robert D. and Lov\'{a}sz, L\'{a}szl\'{o} and Rajaraman, Rajmohan and Sundaram, Ravi and Vetta, Adrian},
 title = {({A}lmost) Tight bounds and existence theorems for single-commodity confluent flows},
 journal = {J. ACM},
 issue_date = {July 2007},
 volume = {54},
 number = {4},
 month = jul,
 year = {2007},
 issn = {0004-5411},
 pages = {16:1--16:32}
}

@article{ChChGrid,
 author = {Chekuri, Chandra and Chuzhoy, Julia},
 title = {Polynomial Bounds for the Grid-Minor Theorem},
 journal = {J. ACM},
 volume = {63},
 number = {5},
 year = {2016},
 pages = {40:1--40:65}
} 

@article{HaWoTree,
        author = "Harvey, David and Wood, David",
        title = "Parameters tied to treewidth",
	journal = {Journal of Graph Theory},
	volume = 84,
	year = 2017,
	pages = {364--385}
}

@unpublished{Fox,
        author = "Fox, Jacob",
        title = "Constructing dense graphs with sublinear {H}adwiger number",
        url = "http://arxiv.org/abs/1108.4953",
        note = "J. Combin. Theory Ser. B, to appear"
}

@article {BPTWBand,
    AUTHOR = {B{\"o}ttcher, Julia and Pruessmann, Klaas P. and Taraz, Anusch
              and W{\"u}rfl, Andreas},
     TITLE = {Bandwidth, expansion, treewidth, separators and universality
              for bounded-degree graphs},
   JOURNAL = {European J. Combin.},
  FJOURNAL = {European Journal of Combinatorics},
    VOLUME = {31},
      YEAR = {2010},
    NUMBER = {5},
     PAGES = {1217--1227},
      ISSN = {0195-6698},
   MRCLASS = {05C12 (05C10 05C83)},
  MRNUMBER = {2644412 (2012a:05091)},
       DOI = {10.1016/j.ejc.2009.10.010},
       URL = {http://dx.doi.org/10.1016/j.ejc.2009.10.010},
}

@article {BGHKTree,
    AUTHOR = {Bodlaender, Hans L. and Gilbert, John R. and Hafsteinsson,
              Hj{\'a}lmt{\'y}r and Kloks, Ton},
     TITLE = {Approximating treewidth, pathwidth, frontsize, and shortest
              elimination tree},
   JOURNAL = {J. Algorithms},
  FJOURNAL = {Journal of Algorithms},
    VOLUME = {18},
      YEAR = {1995},
    NUMBER = {2},
     PAGES = {238--255},
      ISSN = {0196-6774},
       DOI = {10.1006/jagm.1995.1009},
       URL = {http://dx.doi.org/10.1006/jagm.1995.1009},
}

@article{PR1,
    author = {Pinontoan, Benny and Richter, R. Bruce},
     title = {Crossing numbers of sequences of graphs. {I}. {G}eneral tiles},
   journal = {Australas. J. Combin.},
    volume = {30},
      year = {2004},
     pages = {197--206}
}

@article{PR2,
    AUTHOR = {Pinontoan, Benny and Richter, R. Bruce},
     TITLE = {Crossing numbers of sequences of graphs. {II}. {P}lanar tiles},
   JOURNAL = {J. Graph Theory},
  FJOURNAL = {Journal of Graph Theory},
    VOLUME = {42},
      YEAR = {2003},
    NUMBER = {4},
     PAGES = {332--341},
   MRCLASS = {05C10},
  MRNUMBER = {1963105 (2004e:05060)},
       DOI = {10.1002/jgt.10097},
       URL = {http://dx.doi.org/10.1002/jgt.10097},
}
		
@article{Pinon06,
    AUTHOR = {Pinontoan, Benny},
     TITLE = {Tile with rational average crossing number},
   JOURNAL = {J. Indones. Math. Soc.},
  FJOURNAL = {Journal of the Indonesian Mathematical Society. Majalah Ilmiah
              Himpunan Matematika Indonesia (MIHMI)},
    VOLUME = {12},
      YEAR = {2006},
    NUMBER = {1},
     PAGES = {83--87},
   MRCLASS = {05C10},
  MRNUMBER = {2208030 (2006i:05051)},
}

@MISC{BIRSreport,
   author = "Archdeacon, Dan and Salazar, Gelasio and Sz\'ekely, L\'azsl\'o",
   note = "Crossing numbers turn useful, Report on BIRS Workshop (11w5144)",
   url  = "http://www.birs.ca/workshops/2011/11w5144/report11w5144.pdf",
   year = 2011
   }

@article{plansat,
  author    = {David Lichtenstein},
  title     = {Planar Formulae and Their Uses},
  journal   = {SIAM J. Comput.},
  volume    = {11},
  year      = {1982},
  pages     = {329-343}
}

@inproceedings{minalg1,
author={K. Kawarabayashi and P. Wollan},
title={A simpler algorithm and shorter proof for the graph minor decomposition},
booktitle = {STOC},
year      = {2011},
pages     = {451--458},
crossref  = {stoc43}}

@inproceedings{minalg2,
  author    = {Martin Grohe and {Ken-ichi} Kawarabayashi and Bruce A. Reed},
  title     = {A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory},
  booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} {S}ymposium
               on {D}iscrete {A}lgorithms, {SODA} 2013, {N}ew {O}rleans, {L}ouisiana,
	       {USA}, {J}anuary 6-8, 2013},
  year      = {2013},
  pages     = {414--431},
  publisher = {SIAM},
}

@article{locplanq,
author={J. P. Hutchinson},
title={Three-Coloring Graphs Embedded on Surfaces with All Faces Even-Sided},
journal={J. Combin. Theory, Ser.~B},
volume=65,
pages="139--155",
year=1995}

@article{NakNegOta,
author = {A. Nakamoto and S. Negami and K. Ota},
title={Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces},
journal={Discrete Math.},
volume =285,
year=2004,
pages="211--218"}

@article{MohSey,
author={B. Mohar and P. D. Seymour},
title={Coloring locally bipartite graphs on surfaces},
journal={J. Combin. Theory, Ser.~B},
volume=84,
year=2002,
pages="301--310"}

@article{chooscomplex,
author="S. Gutner",
title="The complexity of planar graph choosability",
journal="Discrete Math.",
volume=159,
year=1996,
pages="119--130"}

@article{cabello-sepcurv,
author={S. Cabello and B. Mohar},
title={Finding shortest non-separating and non-contractible cycles for topologically embedded graphs},
journal={Discrete Comput. Geom.},
volume=37,
year=2007,
pages="213--235"}

@article{listcoltw,
 author = {K. Jansen and P. Scheffler},
 title = {Generalized coloring for tree-like graphs},
 journal = {Discrete Appl. Math.},
 volume = {75},
 year = {1997},
 pages = {135--155}
} 

@inproceedings{topmintest,
  author    = {M. Grohe and K. Kawarabayashi and D. Marx and P. Wollan},
  title     = {Finding topological subgraphs is fixed-parameter tractable},
  booktitle = {STOC},
  year      = {2011},
  pages     = {479-488},
  crossref  = {stoc43}
}

@proceedings{stoc43,
  editor    = {Lance Fortnow and
               Salil P. Vadhan},
  title     = {Proceedings of the 43rd ACM Symposium on Theory of Computing,
               STOC 2011, San Jose, CA, USA, 6-8 June 2011},
  booktitle = {STOC},
  publisher = {ACM},
  year      = {2011}
}

@article{nepol,
  author="J. Ne\v{s}et\v{r}il and S. Poljak",
  title="Complexity of the subgraph problem",
  journal="Comment. Math. Univ. Carol.",
  volume=26,
  year=1985,
  pages="415--420"}

@article{fellows,
  author = "R. Downey and M. Fellows",
  year=1995,
  title="Fixed-parameter tractability and completeness. {II}. {O}n completeness for {W}[1]",
  journal="Theoretical Computer Science",
  volume=141,
  pages="109--131"}

@article{bib-eppstein99,
  author="D. Eppstein",
  title="Subgraph isomorphism in planar graphs and related problems",
  journal="Journal of Graph Algorithms and Applications",
  volume=3,
  year=1999,
  pages="1--27"}

@article{subdivchar,
  title={On forbidden subdivision characterizations of graph classes},
  author={Z. Dvo{\v{r}}{\'a}k},
  journal={European Journal of Combinatorics},
  volume={29},
  number={5},
  pages={1321--1332},
  year={2008}
}

@article{fg,
 author = {M. Frick and M. Grohe},
 title = {Deciding first-order properties of locally tree-decomposable structures},
 journal = {J. ACM},
 volume = {48},
 year = {2001},
 pages = {1184--1206}
} 

@inproceedings{kreedsep,
  author = {K. Kawarabayashi and B. Reed},
  year = 2010,
  title = "A separator theorem in minor-closed classes",
  booktitle = {Proc. 51st Annual IEEE Symposium on. Foundations of Computer Science}}

@article{ssep1,
  title={Fast algorithms for shortest paths in planar graphs, with applications},
  author={Federickson, Greg N},
  journal={SIAM Journal on Computing},
  volume={16},
  number={6},
  pages={1004--1022},
  year={1987},
  publisher={SIAM}
}

@article{ssep2,
  title={Planar separators and parallel polygon triangulation},
  author={Goodrich, Michael T},
  journal={Journal of Computer and System Sciences},
  volume={51},
  number={3},
  pages={374--389},
  year={1995},
  publisher={Elsevier}
}

@article{ssep3,
  title={Separator based sparsification: {I}. {P}lanarity testing and minimum spanning trees},
  author={Eppstein, David and Galil, Zvi and Italiano, Giuseppe F and Spencer, Thomas H},
  journal={Journal of Computer and System Sciences},
  volume={52},
  number={1},
  pages={3--27},
  year={1996}
}

@article{ssep4,
  title={Separator-based sparsification {II}: {E}dge and vertex connectivity},
  author={Eppstein, David and Galil, Zvi and Italiano, Giuseppe F and Spencer, Thomas H},
  journal={SIAM Journal on Computing},
  volume={28},
  number={1},
  pages={341--381},
  year={1998}
}

@article{ssep5,
  title={Exact algorithms for the {H}amiltonian cycle problem in planar graphs},
  author={De{\i}, Vladimir G and Klinz, Bettina and Woeginger, Gerhard J and others},
  journal={Operations Research Letters},
  volume={34},
  number={3},
  pages={269--274},
  year={2006},
  publisher={Elsevier}
}

@article{ssep6,
  title={Girth of a Planar Digraph with Real Edge Weights in {$O(n(\log n)^3)$} Time},
  author={Wulff-Nilsen, Christian},
  journal={arXiv},
  volume={0908.0697},
  year={2009}
}

@article{ssep7,
  title={Shortest paths in directed planar graphs with negative lengths: A linear-space {$O(n \log_2 n)$}-time algorithm},
  author={Klein, Philip N and Mozes, Shay and Weimann, Oren},
  journal={ACM Transactions on Algorithms (TALG)},
  volume={6},
  number={2},
  pages={30},
  year={2010}
}

@article{lt79,
  author={R. Lipton and R. Tarjan},
  year=1979,
  title = "A separator theorem for planar graphs",
  journal = {SIAM Journal on Applied Mathematics},
  volume= 36,
  pages= {177--189}}

@article{lt80,
  author={R. Lipton and R. Tarjan},
  year=1980,
  title = "Applications of a planar separator theorem",
  journal = {SIAM Journal on Computing},
  volume = 9,
  pages = {615--627}}

@article{gilbert,
  author={J. Gilbert and J. Hutchinson and R. Tarjan},
  year=1984,
  title = "A separator theorem for graphs of bounded genus",
  journal = {Journal of Algorithms},
  volume = 5,
  pages = {391--407}}

@article{osmenwood,
 author = {J. Ne\v{s}et\v{r}il and P. {Ossona de Mendez} and D. Wood},
 title = {Characterisations and examples of graph classes with bounded expansion},
 journal = {Eur. J. Comb.},
 volume = {33},
 year = {2012},
 pages = {350--373}
} 


@article{wood-cliques,
 author = {D. Wood},
 title = {On the Maximum Number of Cliques in a Graph},
 journal = {Graph. Comb.},
 volume = {23},
 year = {2007},
 pages = {337--352}
} 

@inproceedings{npom-old,
 author = {J. Ne{\v{s}}et\v{r}il and P. {Ossona de Mendez}},
 title = {Linear time low tree-width partitions and algorithmic consequences},
 booktitle = {Proceedings of the thirty-eighth annual ACM symposium on Theory of computing},
 series = {STOC '06},
 year = {2006},
 pages = {391--400},
 publisher = {ACM}
}

@article{grad1,
author = "J. Ne{\v{s}}et\v{r}il and P. {Ossona de Mendez}",
title = "Grad and classes with bounded expansion {I}. {D}ecompositions",
journal = "European J. Combin.",
volume = 29,
year = 2008,
pages = "760--776"}

@article{grad2,
author = "J. Ne{\v{s}}et\v{r}il and P. {Ossona de Mendez}",
title = "Grad and classes with bounded expansion {II}. {A}lgorithmic aspects",
journal = "European J. Combin.",
volume = 29,
year = 2008,
pages = "777--791"}

@article{grad3,
author = "J. Ne{\v{s}}et\v{r}il and P. {Ossona de Mendez}",
title = "Grad and classes with bounded expansion {III}. {R}estricted graph homomorphism dualities",
journal = "European J. Combin.",
volume = 29,
year = 2008,
pages = "1012--1024"}

@article{npom-nd1,
author = "J. Ne{\v{s}}et\v{r}il and P. {Ossona de Mendez}",
title={First order properties on nowhere dense structures},
journal="J. Symbolic Logic",
volume=75,
year=2010,
pages="868--887"}

@article{npom-nd2,
author = "J. Ne{\v{s}}et\v{r}il and P. {Ossona de Mendez}",
title = "On nowhere dense graphs",
journal = "European J. Combin.",
volume = 32,
year = 2011,
pages = "600--617"}

@inproceedings{dkt-fol,
  author    = {Z. Dvo\v{r}\'ak and D. Kr{\'a}l' and R. Thomas},
  title     = {Deciding First-Order Properties for Sparse Graphs},
  year      = {2010},
  pages     = {133-142},
  crossref  = {focs2010}
}

@proceedings{focs2010,
  title     = {51th Annual IEEE Symposium on Foundations of Computer Science,
               FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA},
  booktitle = {Proceedings of 51th Annual IEEE Symposium on Foundations of Computer Science},
  publisher = {IEEE Computer Society},
  year      = 2010
}


@incollection{dynds,
   author = {G. Brodal and R. Fagerberg},
   title = {Dynamic Representations of Sparse Graphs},
   booktitle = {Algorithms and Data Structures},
   series = {Lecture Notes in Computer Science},
   publisher = {Springer Berlin / Heidelberg},
   pages = {773-773},
   volume = {1663},
   year = {1999}}

@book{4algs,
  author= {T. H. Cormen and C. E. Leiserson and R. L. Rivest and C. Stein},
  title={Introduction to algorithms},
  publisher={The MIT Press},
  year=2009}

@inproceedings{dk-surv,
  author={Z. Dvo\v{r}\'ak and D. Kr\'al'},
  title={Algorithms for classes of graphs with bounded expansion},
  booktitle={Proceedings of WG'09},
  series="Lecture Notes in Computer Science",
  volume=5911,
  publisher="Springer",
  year=2009,
  pages="17--32"}

@article{numplan,
author = "A. Denise and M. Vasconcellos and D. Welsh",
title = "The random planar graph",
journal = "Congr. Numer.",
volume=113,
year=1996,
pages = "61--79"}

@article{Alb98,
    AUTHOR = {Albertson, Michael O.},
     TITLE = {You can't paint yourself into a corner},
   JOURNAL = {J. Combin. Theory, Ser.~B},
    VOLUME = {73},
      YEAR = {1998},
    NUMBER = {2},
     PAGES = {189--194}
}

@article{Albertson76,
    AUTHOR = {Albertson, Michael O.},
     TITLE = {A lower bound for the independence number of a planar graph},
   JOURNAL = {J. Combin. Theory, Ser.~B},
    VOLUME = 20,
      YEAR = 1976,
    NUMBER = 1,
     PAGES = {84--93}
}

@article{thom-2007,
  author    = {Carsten Thomassen},
  title     = {Exponentially many 5-list-colorings of planar graphs},
  journal   = {J. Combin. Theory, Ser.~B},
  volume    = 97,
  year      = 2007,
  pages     = {571-583}}

@article{bencan,
author="E. A. Bender and E. R. Canfield",
title="The Asymptotic Number of Labeled Graphs with Given Degree Sequences",
journal="J. Combin. Theory, Ser.~A",
volume=24,
year=1978,
pages="296--307"}

@article{fc367,
  author={Z. Dvo\v{r}\'ak and B. Lidick\'y and R. \v{S}krekovski},
  title={3-choosability of triangle-free planar graphs with constraints on 4-cycles},
  journal={SIAM J. Discrete Math.},
  volume=24,
  year=2010,
  pages="934--945"}

@article{gonthier2008formal,
  title={Formal proof--the four-color theorem},
  author={G. Gonthier},
  journal={Notices of the AMS},
  volume=55,
  number=11,
  pages={1382--1393},
  year=2008}

@article{minor2,
  author = {A. Thomason},
  title = {An extremal function for complete subgraphs},
  journal = {Math. Proc. Camb. Phil. Soc.},
  volume = 95,
  year = 1984,
  pages = {261--265}}

@article{bolo,
  author = {B. Bollob{\'a}s},
  title = {The isoperimetric number of random regular graphs},
  journal = {European Journal of Combinatorics},
  volume = 9,
  year = 1988,
  pages = {241--244}}

@article{AlbBolTuc,
  author = {M. Albertson and B. Bollob\'as and S. Tucker},
  title = {The independence ratio and the maximum degree of a graph},
  journal = {Congr. Numer.},
  volume = 17,
  year = 1976,
  pages = "43--50"}

@article{SteinbergTovey1993,
    AUTHOR = {Steinberg, Richard and Tovey, Craig A.},
     TITLE = {Planar {R}amsey numbers},
   journal={J. Combin. Theory, Ser.~B},
    VOLUME = {59},
      YEAR = {1993},
    NUMBER = {2},
     PAGES = {288--296}
}


@article{steinberger2010unavoidable,
  title={An unavoidable set of {D}-reducible configurations},
  author={J. P. Steinberger},
  journal={Trans. Amer. Math. Soc},
  volume=362,
  pages={6633--6661},
  year=2010}

@article{bartoth,
author="J. Bart and G. Tth",
year=2010,
title="Towards the {A}lbertson {C}onjecture",
journal="Electronic Journal of Combinatorics",
volume=17,
pages="R73"}

@article{krst,
author="D. Krl' and L. Stacho",
title="Coloring plane graphs with independent crossings",
journal="J. Graph Theory",
volume=64,
year=2010,
pages="184--205"}

@article{CaHa11,
author={V. Campos and F. Havet},
title={5-choosability of graphs with 2 crossings},
journal = {ArXiv},
volume={1105.2723},
year=2011
}

@article{LidDvoSkre,
author={Z. Dvo\v{r}\'ak and B. Lidick\'y and R. \v{S}krekovski},
title={Graphs with two crossings are 5-choosable},
journal="SIAM J. Discrete Math.",
volume=25,
year=2011,
pages="1746--1753"}

@article{LidDvoMohPos,
author={Z. Dvo\v{r}\'ak and B. Lidick\'y and B. Mohar and L. Postle},
title={$5$-list-coloring planar graphs with distant precolored vertices},
journal = {Journal of Combinatorial Theory, Series B},
volume = 122,
year=2017,
pages={311--352}
}

@article{le4far,
author={Z. Dvo\v{r}\'ak},
title={$3$-choosability of planar graphs with $(\le\!4)$-cycles far apart},
journal={Journal of Combinatorial Theory, Series B},
volume=104,
pages={28--59},
year=2014}

@inproceedings{dvokawalg,
  author    = {Zden{\v{e}}k Dvo{\v{r}}{\'a}k and
               {Ken-ichi} Kawarabayashi},
  title     = {List-coloring embedded graphs},
  booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} {S}ymposium
               on {D}iscrete {A}lgorithms, {SODA} 2013, {N}ew {O}rleans, {L}ouisiana,
	       {USA}, {J}anuary 6-8, 2013},
  publisher = {SIAM},
  year      = {2013},
  pages     = {1004--1012},
}

@article{Ballantine,
    AUTHOR = {Ballantine, J. P.},
     TITLE = {A postulational introduction to the four color problem},
   JOURNAL = {Publ. in Math., Univ. of Washington, Seattle},
      YEAR = {1930},
     PAGES = {1--16},
}

@article{EHLP-11,
author={R. Erman and F. Havet and B. Lidick\'{y} and O. Pangr\'{a}c},
title={5-colouring graphs with 4 crossings},
journal="SIAM J. Discrete Math.",
volume=25,
pages={401--422},
year=2011}

@article{rsst,
author = "N. Robertson and D. P. Sanders and P. Seymour and R. Thomas",
title = "The four colour theorem",
journal = "J. Combin. Theory, Ser.~B",
volume = 70,
year = 1997,
pages = "2--44"}

@article{Fisk78,
    AUTHOR = {S. Fisk},
     TITLE = {The nonexistence of colorings},
   JOURNAL = {J. Combin. Theory, Ser.~B},
    VOLUME = 24,
      YEAR = 1978,
     PAGES = {247--248},
}

@article{Albhut,
author="M. Albertson and J. Hutchinsonn",
title="The three excluded cases of {D}irac's map-color theorem",
journal = {Annals of the New York Academy of Sciences},
volume = 319,
publisher = {Blackwell Publishing Ltd},
pages = {7--17},
year = 1979}

@unpublished{pothom,
author = "L. Postle and R. Thomas",
title = "A {L}inear {U}pper {B}ound for 6-{C}ritical {G}raphs on {S}urfaces",
note = "Manuscript"}

@book{nesbook,
author="J. Ne{\v{s}}et\v{r}il and P. {Ossona de Mendez}",
title="Sparsity (Graphs, Structures, and Algorithms)",
volume=28,
series={Algorithms and Combinatorics},
publisher = "Springer",
year=2012}

@book{mohthom,
author = "B.~Mohar and C.~Thomassen",
title = "Graphs on Surfaces",
publisher = "The Johns Hopkins University Press",
address = "Baltimore and London",
year = 2001}

@article{Thomassen97,
    AUTHOR = {C. Thomassen},
     TITLE = {Color-critical graphs on a fixed surface},
   JOURNAL = {J. Combin. Theory, Ser.~B},
    VOLUME = 70,
      YEAR = 1997,
     PAGES = "67--100"
}

@article{Thomassen93,
author = "Carsten Thomassen",
title = "Five-{C}oloring {M}aps on {S}urfaces",
journal = "J. of Combin. Theory, Ser.~B",