37 citations · 86 across the 12 of their papers we have counts for
12 papers
An Arboricity-Sensitive Algorithm for the -Free Graph Sandwich Problem
Min Chih Lin, Natán Vekselman
For a fixed integer , the -free graph sandwich problem asks whether, given graphs on the same vertex set, there is an induced--free graph $…
The interplay between network transitivity and community structure
Mingao Yuan, Irin Rahman, Chengay S Wangchuk +1
Recent empirical observations suggest that network transitivity is highly correlated with community structure in many real-world networks. In this paper, we theoretically investiga…
Counting -convex sets in graphs
Mitre C. Dourado, Luciano N. Grippo, Min Chih Lin +1
We study the -convexity, the path convexity generated by all three-vertex paths, and focus on the problem of counting the -convex vertex sets of a graph , denoted by $…
Removing bottlenecks in the recognition of small -graph classes
Flavia Bonomo-Braberman, Min Chih Lin, Ignacio Maqueda
A graph is a -graph if its vertex set can be partitioned into independent sets and cliques. This family simultaneously generalizes split, bipartite, and co-bip…
Graphs whose vertices of degree at least 2 lie in a triangle
Vinicius L. do Forte, Min Chih Lin, Abilio Lucena +3
A pendant vertex is one of degree one and an isolated vertex has degree zero. A neighborhood star-free (NSF for short) graph is one in which every vertex is contained in a triangle…
Perfect Edge Domination: Hard and Solvable Cases
Min Chih Lin, Vadim Lozin, Veronica A. Moyano +1
Let be an undirected graph. An edge of dominates itself and all edges adjacent to it. A subset of edges of is an edge dominating set of , if every edge of the g…