2 papers
math.CO2025
Separating path systems for cubic graphs and for complete bipartite graphs
Cristina Fernandes, Carlos Hoppen, George Kontogeorgiou +2
A strongly separating path system in a graph is a collection of paths in such that, for every two edges and of , there is a paths in …
math.CO2024
Near rainbow Hamilton cycles in dense graphs
Danni Peng, Zhifei Yan
Finding near-rainbow Hamilton cycles in properly edge-coloured graphs was first studied by Andersen, who proved in 1989 that every proper edge colouring of the complete graph on $n…