1. 3-coloring triangle-free planar graphs with a precolored 9-cycle. (February 2018) Authors: Choi, Ilkyoo; Ekstein, Jan; Holub, Přemysl; Lidický, Bernard Journal: European journal of combinatorics Issue: Volume 68(2018) Page Start: 38 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. 3‐Coloring Triangle‐Free Planar Graphs with a Precolored 8‐Cycle. Issue 2 (3rd December 2014) Authors: dvořák, zdeněk; Lidický, Bernard Journal: Journal of graph theory Issue: Volume 80:Issue 2(2015) Page Start: 98 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Coloring count cones of planar graphs. Issue 1 (10th November 2021) Authors: Dvořák, Zdeněk; Lidický, Bernard Journal: Journal of graph theory Issue: Volume 100:Issue 1(2022) Page Start: 84 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Making Kr+1-free graphs r-partite. (10th July 2021) Authors: Balogh, József; Clemen, Felix Christian; Lavrov, Mikhail; Lidický, Bernard; Pfender, Florian Journal: Combinatorics, probability and computing Issue: Volume 30:Number 4(2021) Page Start: 609 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Maximizing five-cycles in Kr-free graphs. (October 2021) Authors: Lidický, Bernard; Murphy, Kyle Journal: European journal of combinatorics Issue: Volume 97(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle. (February 2016) Authors: Balogh, József; Hu, Ping; Lidický, Bernard; Pfender, Florian Journal: European journal of combinatorics Issue: Volume 52: Part A (2016:Feb.) Page Start: 47 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Minimizing the number of 5-cycles in graphs with given edge-density. (9th January 2020) Authors: Bennett, Patrick; Dudek, Andrzej; Lidický, Bernard; Pikhurko, Oleg Journal: Combinatorics, probability and computing Issue: Volume 29:Number 1(2020) Page Start: 44 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. On Choosability with Separation of Planar Graphs with Forbidden Cycles. Issue 3 (10th April 2015) Authors: Choi, Ilkyoo; Lidický, Bernard; Stolee, Derrick Journal: Journal of graph theory Issue: Volume 81:Issue 3(2016) Page Start: 283 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs. Issue 4 (22nd March 2016) Authors: Gethner, Ellen; Hogben, Leslie; Lidický, Bernard; Pfender, Florian; Ruiz, Amanda; Young, Michael Journal: Journal of graph theory Issue: Volume 84:Issue 4(2017) Page Start: 552 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. Ore and Chvátal‐type degree conditions for bootstrap percolation from small sets. Issue 2 (8th November 2019) Authors: Dairyko, Michael; Ferrara, Michael; Lidický, Bernard; Martin, Ryan R.; Pfender, Florian; Uzzell, Andrew J. Journal: Journal of graph theory Issue: Volume 94:Issue 2(2020) Page Start: 252 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗