3 papers
math.CO2025
On the Treewidth of Token and Johnson Graphs
Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia, César Hernández-Cruz +1
Let be a graph on vertices and a fixed integer. The \textit{-token graph} of is the graph whose vertex set consists of all -subsets of th…
math.CO2025
On the expressive power of -edge-colourings of graphs
Jan Bok, Santiago Guzmán-Pro, Nikola JedliÄková +1
Given a finite set of -edge-coloured graphs and a hereditary property of graphs , we say that expresses if a graph has t…
math.CO2024
-polarity and algorithmic aspects of polarity variants on cograph superclasses
Fernando Esteban Contreras-Mendoza, César Hernández-Cruz
A graph is said to be an -polar graph if its vertex set admits a partition such that and induce, respectively, a complete -partite graph and the dis…