6 papers
Monadic dependence from reducts, and applications to twin-width of oriented graphs
Hector Buffière, Yuquan Lin, Patrice Ossona de Mendez
We study monadic dependence of binary relational structures including at least one antisymmetric relation. Our cornerstone result gives sufficient conditions for proving that a str…
On merge-models
Hector Buffière, Yuquan Lin, Jaroslav Nešet{ř}il +2
Tree-ordered weakly sparse models have recently emerged as a robust framework for representing structures in an ``almost sparse'' way, while allowing the structure to be reconstruc…
Computational results on semistrong edge coloring of graphs
Yuquan Lin, Wensong Lin
The semistrong edge coloring, as a relaxation of the well-known strong edge coloring, can be used to model efficient communication scheduling in wireless networks. An edge coloring…
Semistrong edge colorings of planar graphs
Yuquan Lin, Wensong Lin
Strengthened notions of a matching of a graph have been considered, requiring that the matching has some properties with respect to the subgraph of induced by…
Semistrong edge coloring and -relaxed strong edge coloring of graphs
Yuquan Lin, Wensong Lin
In this work, we study two relaxations of the well-known strong edge coloring. A semistrong edge coloring of a graph G is an edge coloring in which every color class forms a matchi…
The tight bound for the strong chromatic indices of claw-free subcubic graphs
Yuquan Lin, Wensong Lin
Let be a graph and a positive integer. A strong -edge-coloring of is a mapping such that for any two edges and that are either…