ESEvelyne Smith-Roberge
Evelyne Smith-Roberge
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Evelyne Smith-Roberge has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Luke Postle
Combinatorics and Optimization Department University of Waterloo N2L 3G1 Waterloo Ontario Canada
1 shared publication
Latest Publications
- Open Access
On the choosability with separation of planar graphs and its correspondence colouring analogue
A list assignment $L$ for a graph $G$ is an $(\ell,k)$-list assignment if $|L(v)|\geq \ell$ for each $v \in V(G)$ and $|L(u) \cap L(v)| \leq k$ for each $uv \in E(G)$. We say $G$ is $(\ell,k)$-choosable if it admits an $L$-colouring for every $(\ell, k)$-list assignment $L$. We prove that if $G$ is a planar graph with $(4,2)$-list assignment $L$ and for every triangle $T \subseteq G$ we have that $|\bigcap_{v \in V(T)} L(v)| \neq 2$, then $G$ is $L$-colourable. In fact, we prove a slightly stronger result: if $G$ contains a clique $H$ such that $V(H) \cap V(T) \neq \emptyset$ for every triangle $T \subseteq G$ with $|\bigcap_{v \in V(T)} L(v)| = 2$, then $G$ is $L$-colourable. Additionally, we give a counterexample to the correspondence colouring analogue of $(4,2)$-choosability for planar graphs.Open AccessOn the choosability with separation of planar graphs and its correspondence colouring analogue
A list assignment $L$ for a graph $G$ is an $(\ell,k)$-list assignment if $|L(v)|\geq \ell$ for each $v \in V(G)$ and $|L(u) \cap L(v)| \leq k$ for each $uv \in E(G)$. We say $G$ is $(\ell,k)$-choosable if it admits an $L$-colouring for every $(\ell, k)$-list assignment $L$. We prove that if $G$ is a planar graph with $(4,2)$-list assignment $L$ and for every triangle $T \subseteq G$ we have that $|\bigcap_{v \in V(T)} L(v)| \neq 2$, then $G$ is $L$-colourable. In fact, we prove a slightly stronger result: if $G$ contains a clique $H$ such that $V(H) \cap V(T) \neq \emptyset$ for every triangle $T \subseteq G$ with $|\bigcap_{v \in V(T)} L(v)| = 2$, then $G$ is $L$-colourable. Additionally, we give a counterexample to the correspondence colouring analogue of $(4,2)$-choosability for planar graphs. - 18 February 2022
- Published by Springer Nature in Combinatorica
- Vol. 42 (2) , 253-300
On the Density of C7-Critical Graphs
- 18 February 2022
- Published by Springer Nature in Combinatorica
- Vol. 42 (2) , 253-300
On the Density of C7-Critical Graphs