17 citations · 84 across the 50 of their papers we have counts for
5 papers · 1 filter
Maximizing proper colorings on graphs
Jie Ma, Humberto Naves
The number of proper -colorings of a graph , denoted by , is an important graph parameter that plays fundamental role in graph theory, computational complexity theory…
Cycles with consecutive odd lengths
Jie Ma
It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cyc…
Diameter critical graphs
Po-Shen Loh, Jie Ma
A graph is called diameter--critical if its diameter is , and the removal of any edge strictly increases the diameter. In this paper, we prove several results related to a co…
Longest common subsequences in sets of words
Boris Bukh, Jie Ma
Given a set of words of length over a -letter alphabet, it is proved that there exists a common subsequence among two of them of length at least $\frac{n}{k}+cn^{1-1/(t-…
Coloring Digraphs with Forbidden Cycles
Zhibin Chen, Jie Ma, Wenan Zang
Let and be two integers with and . In this paper we show that (1) if a strongly connected digraph contains no directed cycle of length modul…