C. N. Lintzmayer

activity

20172026

collaborators

5 papers

math.CO2026

An 18-colour bound for locally irregular decompositions

Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli +1

A graph is locally irregular if adjacent vertices have distinct degrees. A graph G is decomposable if its edge set can be decomposed into locally irregular graphs, and its locally…

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

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 +3

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…

math.CO2017

Edge-magic labelings for constellations and armies of caterpillars

Márcia R. Cerioli, Cristina G. Fernandes, Orlando Lee +3

Let $G = (V, E)$ be an $n$ -vertex graph with $m$ edges. A function $f : V \cup E \to {1, \dots, n + m}$ is an edge-magic labeling of $G$ if $f$ is bijective and, for some int…