11 citations · 44 across the 21 of their papers we have counts for
5 papers · 1 filter
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…
Subchromatic numbers of powers of graphs with excluded minors
Pedro P. Cortés, Pankaj Kumar, Benjamin Moore +2
A -subcolouring of a graph is a function such that the set of vertices coloured induce a disjoint union of cliques. The subchromatic number…
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…
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…