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.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…
math.CO2025
Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
Fábio Botler, Cristina G. Fernandes, Carla N. Lintzmayer +4
An immersion of a graph in a graph is a minimal subgraph of for which there is an injection and a set of edge-disjoint paths $\{P_e:…