1. (k, l)-colourings and Ferrers diagram representations of cographs. (January 2021) Authors: Epple, Dennis A.; Huang, Jing Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. (k, l)-colourings and Ferrers diagram representations of cographs. (January 2021) Authors: Epple, Dennis D.A.; Huang, Jing Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. 2-connected chordal graphs and line graphs are (1, 5)-choosable. (January 2021) Authors: Wong, Tsai-Lien Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. 3-regular graphs are 2-reconstructible. (January 2021) Authors: Kostochka, Alexandr V.; Nahvi, Mina; West, Douglas B.; Zirlin, Dara Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. An analogue of the Erdős–Gallai theorem for random graphs. (January 2021) Authors: Balogh, József; Dudek, Andrzej; Li, Lina Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Bounding the number of cycles in a graph in terms of its degree sequence. (January 2021) Authors: Dvořák, Zdeněk; Morrison, Natasha; Noel, Jonathan A.; Norin, Sergey; Postle, Luke Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. (January 2021) Authors: Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Rabinovich, Roman; Siebertz, Sebastian Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. Concepts of signed graph coloring. (January 2021) Authors: Steffen, Eckhard; Vogel, Alexander Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. Distance-two colourings of Barnette graphs. (January 2021) Authors: Feder, Tomás; Hell, Pavol; Subi, Carlos Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. Editorial Board. (January 2021) Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗