Fares Soufan

collaborators

2 papers

math.CO2026

List coloring $C_{3}$ -free planar graphs with a sparse matching of restricted lists

Stephen G. Hartke, Yupei Li, Joseph Pappe +3

A graph $G$ is $k$ -choosable if it has a proper coloring for every $k$ -list assignment. While every $C_{3}$ -free planar graph is $4$ -choosable, some of them are not $3$ -choosable, as…

math.NT2022

On the Parity of the Generalized Frobenius Partition Functions $ϕ_{k} (n)$

George E. Andrews, James A. Sellers, Fares Soufan

In his 1984 Memoir of the American Mathematical Society, George Andrews defined two families of functions, $ϕ_{k} (n)$ and $c ϕ_{k} (n),$ which enumerate two types of combinatorial object…

List coloring C3​-free planar graphs with a sparse matching of restricted lists

On the Parity of the Generalized Frobenius Partition Functions ϕk​(n)

List coloring $C_{3}$ -free planar graphs with a sparse matching of restricted lists

On the Parity of the Generalized Frobenius Partition Functions $ϕ_{k} (n)$