C. N. Lintzmayer

activity

20242026

collaborators

4 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, $χ_{p c f} (G)$ , of a graph $G$ is the least $k$ such that $G$ has a proper $k$ -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 $H$ in a graph $G$ is a minimal subgraph $I$ of $G$ for which there is an injection $i : V (H) \to V (I)$ and a set of edge-disjoint paths $\{P_e:…

math.CO2024

A study on token digraphs

Cristina G. Fernandes, Carla N. Lintzmayer, Juan P. PeÃ±a +4

For a digraph $D$ of order $n$ and an integer $1 \leq k \leq n - 1$ , the $k$ -token digraph of $D$ is the graph whose vertices are all $k$ -subsets of vertices of $D$ and, given two su…