5 citations · 23 across the 13 of their papers we have counts for
13 papers
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…
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…
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:…
A study on token digraphs
Cristina G. Fernandes, Carla N. Lintzmayer, Juan P. Peña +3
For a digraph of order and an integer , the -token digraph of is the graph whose vertices are all -subsets of vertices of and, given two su…
A faster heuristic for the Traveling Salesman Problem with Drone
Pedro H. D. B. Hokama, Carla N. Lintzmayer, Mário C. San Felice
Given a set of customers, the Flying Sidekick Traveling Salesman Problem (FSTSP) consists of using one truck and one drone to perform deliveries to them. The drone is limited to de…
Approximations for the Steiner Multicycle Problem
Cristina G. Fernandes, Carla N. Lintzmayer, Phablo F. S. Moura
The Steiner Multicycle problem consists of, given a complete graph, a weight function on its vertices, and a collection of pairwise disjoint non-unitary sets called terminal sets,…
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…
Biclique immersions in graphs with independence number 2
Fábio Botler, Andrea Jiménez, Carla N. Lintzmayer +3
The analogue of Hadwiger's conjecture for the immersion relation states that every graph contains an immersion of . For graphs with independence number 2, this is equ…
How heavy independent sets help to find arborescences with many leaves in DAGs
Cristina G. Fernandes, Carla N. Lintzmayer
Trees with many leaves have applications on broadcasting, which is a method in networks for transferring a message to all recipients simultaneously. Internal nodes of a broadcastin…
Leafy Spanning Arborescences in DAGs
Cristina G. Fernandes, Carla N. Lintzmayer
Broadcasting in a computer network is a method of transferring a message to all recipients simultaneously. It is common in this situation to use a tree with many leaves to perform…
Decomposing split graphs into locally irregular graphs
Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli
A graph is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph is a decomposition of such t…
Online Circle and Sphere Packing
Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier
In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones recei…
Edge-magic labelings for constellations and armies of caterpillars
Márcia R. Cerioli, Cristina G. Fernandes, Orlando Lee +3
Let be an -vertex graph with edges. A function is an edge-magic labeling of if is bijective and, for some int…