Showing 2025Show all
3 papers · 1 filter
cs.DS2025
A Polynomial-Time Approximation Algorithm for Complete Interval Minors
Romain Bourneuf, Julien Cocquet, Chaoliang Tang +1
As shown by Robertson and Seymour, deciding whether the complete graph is a minor of an input graph is a fixed parameter tractable problem when parameterized by . From…
math.CO2025
1-2 Conjectures for Graphs with Low Degeneracy Properties
Julien Bensmail, Beatriz Martins, Chaoliang Tang
In a recent work, Keusch proved the so-called 1-2-3 Conjecture, raised by Karoński, Łuczak, and Thomason in 2004: for every connected graph different from , we can assign labe…
math.CO2025
On 1-11-representability and multi-1-11-representability of graphs
Mohammed Alshammari, Sergey Kitaev, Chaoliang Tang +2
Jeff Remmel introduced the concept of a -11-representable graph in 2017. This concept was first explored by Cheon et al. in 2019, who considered it as a natural extension of wor…