11 citations · 16 across the 4 of their papers we have counts for
9 papers
Fractional balanced chromatic number and arboricity of planar (signed) graphs
Reza Naserasr, Lan Anh Pham, Cyril Pujol +1
A fractional coloring of a signed graph is an assignment of nonnegative weights to the balanced sets (sets which do not induce a negative cycle) such that each vertex has…
Density of -critical signed graphs
Reza Naserasr, Lan Anh Pham, Zhouningxin Wang
A signed bipartite (simple) graph is said to be -critical if it admits no homomorphism to (a negative 4-cycle) but every proper subgraph of it does. In th…
Restricted extension of sparse partial edge colorings of complete graphs
Carl Johan Casselgren, Lan Anh Pham
Given a partial edge coloring of a complete graph and lists of allowed colors for the non-colored edges of , can we extend the partial edge coloring to a proper edge col…
On restricted colorings of -edge colorable graphs
Lan Anh Pham
A cycle is -colored if its edges are properly colored by two distinct colors. A -edge colorable graph is a -regular graph that admits a proper -edge coloring in…
Latin cubes of even order with forbidden entries
Carl Johan Casselgren, Lan Anh Pham
We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant such that i…
Latin Cubes with Forbidden Entries
Carl Johan Casselgren, Klas Markström, Lan Anh Pham
We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant such that i…