2 papers
math.CO2025
Extension of the Gyárfás-Sumner conjecture to signed graphs
Guillaume Aubian, Allen Ibiapina, Luis Kuffner +4
The balanced chromatic number of a signed graph G is the minimum number of balanced sets that cover all vertices of G. Studying structural conditions which imply bounds on the bala…
cs.DM2025
How to Color Temporal Graphs to Ensure Proper Transitions
Allen Ibiapina, Minh Hang Nguyen, Mikaël Rabie +1
Graph Coloring consists in assigning colors to vertices ensuring that two adjacent vertices do not have the same color. In dynamic graphs, this notion is not well defined, as we ne…