5 citations · 5 across the 3 of their papers we have counts for
3 papers
math.CO2026
Optimal b-Colourings and Fall Colourings in -Free Graphs
Jungho Ahn, Tala Eagling-Vose, Felicia Lucke +3
In a colouring of a graph, a vertex is b-chromatic if it is adjacent to a vertex of every other colour. We consider four well-studied colouring problems: b-Chromatic Number, Tight…
math.CO2023
Polarity on -split graphs
F. Esteban Contreras Mendoza, César Hernández Cruz
Given nonnegative integers, and , an -polar partition of a graph is a partition of such that and are complete multipartite…
cs.CC2017★ 5 cited
Hard and Easy Instances of L-Tromino Tilings
Javier T. Akagi, Carlos F. Gaona, Fabricio Mendoza +2
We study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, no…