António Girão

activity

20142026

most citedGeneralised Majority Colourings of Digraphs

7 citations · 26 across the 38 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

Two Relaxations of the Dominating Hadwiger's Conjecture

António Girão, Sergey Norin, Youri Tamitegama +1

Illingworth and Wood recently proposed the Dominating Hadwiger's Conjecture, a strengthening of Hadwiger's Conjecture which asserts that every graph with no dominating $K_{t}$ -model…

math.CO2026

On $2$ -factors of Hamiltonian graphs

Alberto Espuny Díaz, António Girão, Bertille Granet +1

Let $k \geq 2$ . We show that, for a sufficiently small $ε > 0$ , any sufficiently large $n$ -vertex Hamiltonian graph of minimum degree at least $n^{1 - ε}$ contains a…

math.CO2026

The Dominating 4-Colour Theorem

António Girão, Freddie Illingworth, Bojan Mohar +6

A "dominating $K_{t}$ -model" in a graph $G$ is a sequence $(T_{1}, \dots, T_{t})$ of pairwise vertex-disjoint connected subgraphs of $G$ , such that whenever $1 \leq i < j \leq t$ every vertex…

math.CO2026

Induced subdivisions of $K_{d + 1}$ in graphs of high girth

António Girão, Zach Hunter

In this paper, we show that for all $k \geq 1 0^{8}$ , every graph with minimum degree $k$ and girth at least $1 0^{8}$ contains an induced subdivision of a $K_{k + 1}$ . This answers a probl…

Two Relaxations of the Dominating Hadwiger's Conjecture

On 2-factors of Hamiltonian graphs

The Dominating 4-Colour Theorem

Induced subdivisions of Kd+1​ in graphs of high girth

On $2$ -factors of Hamiltonian graphs

Induced subdivisions of $K_{d + 1}$ in graphs of high girth