6 citations · 23 across the 14 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DM2022
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
Vadim Lozin, Barnaby Martin, Sukanya Pandey +4
For a fixed set of graphs, a graph is -subgraph-free if does not contain any as a (not necessarily induced) subgraph. A recently propo…
math.CO2022
A Brightwell-Winkler type characterisation of NU graphs
Mark Siggers
In 2000, Brightwell and Winkler characterised dismantlable graphs as the graphs for which the Hom-graph , defined on the set of homomorphisms from to , i…
math.CO2022
Mixing is hard for triangle-free reflexive graphs
Hyobeen Kim, Jae-baek Lee, Mark Siggers
In the problem one is given a graph and must decide if the Hom-graph is connected. We show that if is a triangle-free reflexive graph…