1 citations · 1 across the 8 of their papers we have counts for
10 papers · 1 filter
Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs
Yichen Wang, Haixiang Zhang, Mei Lu
Given a graph , a vertex {\em ve-dominates} all edges incident to any vertex of . A set is a {\em ve-dominating set} if for all edges $e\…
Extremal results on Berge disjoint paths
Xiamiao Zhao, Yiyan Zhan, Mei Lu
The well-known Erdős-Gallai Theorem gave the Turán number of paths. Bushaw and Kettle generalized this result to consider the Turán number of disjoint paths. Since then, many studi…
Turán type problems for a fixed graph and a linear forest
Haixiang Zhang, Xiamiao Zhao, Mei Lu
Let be a family of graphs. A graph is -free if does not contain any as a subgraph. The Turán number, denoted by $ex(n, \mathsc…
The Minimum Weighting Ratio Problem and Its Application in Chordal Graphs
Hui Lei, Mei Lu, Yongtang Shi +2
Constructing the maximum spanning tree of an edge-weighted connected graph is one of the important research topics in computer science and optimization, and the related res…
Generalized Turán problems for a matching and long cycles
Xiamiao Zhao, Mei Lu
Let be a family of graphs. A graph is -free if does not contain any as a subgraph. The general Turán number, denoted by $ex(n,…
Partite saturation number of cycles
Yiduo Xu, Zhen He, Mei Lu
A graph is said to be -saturated relative to , if does not contain any copy of , but the addition of any edge in would create a copy of $…