3 citations · 4 across the 4 of their papers we have counts for
4 papers
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…
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…
Boundedness for proper conflict-free and odd colorings
Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer +7
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…
Totally odd immersions in line graphs
Andrea Jiménez, Daniel A. Quiroz, Christopher Thraves Caro
The immersion-analogue of Hadwiger's Conjecture states that every graph contains an immersion of . This conjecture has been recently strengthened in the following way…