From the 2 of 4 linked papers with an AI index.
4 papers
Far-apart ErdÅs--Pósa property of long cycles
Maria Chudnovsky, Vida DujmoviÄ, Gwenaël Joret +4
The authors prove that for any graph, either it contains many cycles of length at least ℓ that are pairwise far apart, or a small vertex set can be removed to eliminate all such lo…
Adjacency labelling for proper minor-closed graph classes
Vida DujmoviÄ, Cyril Gavoille, Gwenaël Joret +3
The paper proves that every proper minor‑closed class of graphs admits an adjacency labeling scheme using (1+o(1))·log₂ n bits, equivalently showing the existence of an n^{1+o(1)}‑…
ErdÅs--Pósa property of cycles that are far apart
Vida DujmoviÄ, Gwenaël Joret, Piotr Micek +1
We prove that there exist functions such that for all nonnegative integers and , for every graph , either contains cycles such that…
3-Colouring Planar Graphs
Vida DujmoviÄ, Pat Morin, Sergey Norin +1
We show that every -vertex planar graph is 3-colourable with monochromatic components of size . The best previous bound was due to Linial, MatouÅ¡ek, Sh…