2 citations · 3 across the 14 of their papers we have counts for
6 papers · 1 filter
Covering graphs by isometric trees
Paul Bastide, Julien Duron, Jędrzej Hodor +2
A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied.…
Perfect tilings with the generalised triangle in -graphs
Weichan Liu, Xiangxiang Nie, Donglei Yang +1
Denote by the generalised triangle, a -uniform hypergraph on vertex set with three edges , and $\{k,k+1,\dots,…
Local rainbow colorings of hypergraphs
Zhenyu Li, Weichan Liu, Guowei Sun +2
In this paper, we generalize the concepts related to rainbow coloring to hypergraphs. Specifically, an -local coloring is defined as a collection of edge-colorings, $f…
Equitable coloring of graphs beyond planarity
Weichan Liu
An equitable coloring of a graph is a proper coloring where the sizes of any two different color classes do not differ by more than one. A graph is IC-planar if it can be drawn in…
Independent transversal blow-up of graphs
Tianjiao Dai, Weichan Liu, Xin Zhang
In an -partite graph, an independent transversal of size (ITS) consists of vertices from each part forming an independent set. Motivated by a question from Bollobás, Erd…
Infinitely many accumulation points of codegree Turán densities
Heng Li, Weichan Liu, Bjarne Schülke +1
The codegree Turán density of a -graph is the smallest such that every -graph with contains a copy of .…