1 citations · 1 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2025★ 1 cited
Burling graphs in graphs with large chromatic number
Tara Abrishami, Marcin Briański, James Davies +4
A graph class is -bounded if the only way to force large chromatic number in graphs from the class is by forming a large clique. In the 1970s, Erdős conjectured that intersectio…
math.CO2025
Path Eccentricity and Forbidden Induced Subgraphs
Sylwia Cichacz, Claire Hilaire, Tomáš Masařík +2
The path eccentricity of a connected graph is the minimum integer such that has a path such that every vertex is at distance at most from the path. A result of Duff…
math.CO2025
Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
Romain Bourneuf, Jana Masaříková, Wojciech Nadara +1
For a fixed integer , a (-)long claw, denoted , is the unique tree with three leaves, each at distance exactly from the vertex of degree three. Majewski…