From the 1 of 5 linked papers with an AI index.
5 papers
ErdÅs-Pósa property of rooted tree minors
Quentin Claus, Gwenaël Joret, Clément Rambaud +1
The paper proves that for any tree T and any vertex set S in a graph G, either G contains k vertex‑disjoint T‑minors rooted in S or there is a vertex set of size O(k) whose removal…
Vu's conjecture holds for claw-free graphs
Linda Cook, Ross J. Kang, Eileen Robinson +1
Given a graph , let denote the maximum number of neighbors any two distinct vertices of have in common. Vu (2002) proposed that, provided is not too smal…
Chromatic discrepancy of locally -colourable graphs
Timothée Corsini, Lucas Picasarri-Arrieta, Théo Pierron +2
The chromatic discrepancy of a graph , denoted , is the least over all proper colourings of of the greatest difference between the number of colours …
Coloring bridge-free antiprismatic graphs
Cléophée Robin, Eileen Robinson
The coloring problem is a well-research topic and its complexity is known for several classes of graphs. However, the question of its complexity remains open for the class of antip…
Path eccentricity of -AT-free graphs and application on graphs with the consecutive ones property
Paul Bastide, Claire Hilaire, Eileen Robinson
The central path problem is a variation on the single facility location problem. The aim is to find, in a given connected graph , a path minimizing its eccentricity, which i…