3 papers
math.CO2026
Proper conflict-free 7-coloring of planar graphs
A. Jiménez, C. N. Lintzmayer, M. Sambinelli
A proper conflict-free coloring is a proper vertex coloring in which every nonisolated vertex has a color occurring uniquely in its open neighborhood. We prove that every graph wit…
math.CO2026
Balanced-chromatic number and Hadwiger-like conjectures
Andrea Jiménez, Jessica McDonald, Reza Naserasr +2
Motivated by different characterizations of planar graphs and the 4-Color Theorem, several structural results concerning graphs of high chromatic number have been obtained. Toward…
math.CO2025
Boundedness for proper conflict-free and odd colorings
Andrea Jiménez, Andrea Jiménez, Kolja Knauer +11
The proper conflict-free chromatic number, , of a graph is the least such that has a proper -coloring in which for each non-isolated vertex there is a co…