Daniel A. Quiroz

collaborators

8 papers

math.CO2026

Odd minors or odd immersions in graphs with independence number two

Antonia Bermúdez, Bruno L. Netto, Daniel A. Quiroz

Kühn, Sauermann, Steiner and Wigderson recently disproved the Odd Hadwiger Conjecture, even for graphs with independence number 2. For this class of graphs the conjecture is known…

math.CO2026

Odd Hadwiger number and graph products

Henry EcheverrÃa, Andrea JimÃ©nez, Suchismita Mishra +2

The Odd Hadwiger number of a graph $G$ is the largest integer $r$ such that $G$ has a clique of size $r$ as an odd minor. In this paper, we investigate how large is the Odd Hadwige…

math.CO2026

Colouring negative exact-distance graphs of signed graphs

Reza Naserasr, Patrice Ossona de Mendez, Daniel A. Quiroz +2

The $k$ -th exact-distance graph, of a graph $G$ has $V (G)$ as its vertex set, and $x y$ as an edge if and only if the distance between $x$ and $y$ is (exactly) $k$ in $G$ . We consid…

math.CO2026

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…

math.CO2026

Homomorphism counting for immersion-closed classes is not isomorphism

LovÃ¡sz proved that two graphs $G$ and $H$ are isomorphic if $hom (K, G) = hom (K, H)$ for all graphs $K$ , where $hom (G_{1}, G_{2})$ denotes the number of homomorphisms from $G_{1}$ to $G_…

math.CO2025

Boundedness for proper conflict-free and odd colorings

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…