Fengming Dong

activity

20142024

most citedOn the maximum local mean order of sub-k-trees of a k-tree

2 citations · 2 across the 8 of their papers we have counts for

collaborators

8 papers

math.CO2024

4-connected 1-planar chordal graphs are Hamiltonian-connected

Licheng Zhang, Yuanqiu Huang, Shengxiang Lv +1

Tutte proved that 4-connected planar graphs are Hamiltonian. It is unknown if there is an analogous result on 1-planar graphs. In this paper, we characterize 4-connected 1-planar c…

math.CO2024

A new infinite family of 4-regular crossing-critical graphs

Zongpeng Ding, Yuanqiu Huang, Fengming Dong

A graph $G$ is said to be crossing-critical if $cr (G - e) < cr (G)$ for every edge $e$ of $G$ , where $cr (G)$ is the crossing number of $G$ . Richter and Thomassen [Journal of Combinator…

math.CO2023

On the colorability of bi-hypergraphs

Meiqiao Zhang, Fengming Dong, Ruixue Zhang

A {\it mixed hypergraph} $H = (V, C, D)$ consists of the vertex set $V$ and two families of subsets of $2^{V}$ : the family $C$ of co-edge…

math.CO2023★ 2 cited

On the maximum local mean order of sub-k-trees of a k-tree

Zhuo Li, Tianlong Ma, Fengming Dong +1

For a k-tree T, a generalization of a tree, the local mean order of sub-k-trees of T is the average order of sub-k-trees of T containing a given k-clique. The problem whether the l…

math.CO2023

The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions

Meiqiao Zhang, Fengming Dong

In 2013, Ku and Wong showed that for any partitions $μ$ and $μ^{'}$ of a positive integer $n$ with the same first part $u$ and the lexicographic order $μ ◃ μ^{'}$ , the eigenva…

math.CO2023

Compare list-color functions of uniform hypergraphs with their chromatic polynomials (II)

Meiqiao Zhang, Fengming Dong

For any $r$ -uniform hypergraph $H$ with $m$ ( $\geq 2$ ) edges, let $P (H, k)$ and $P_{l} (H, k)$ be the chromatic polynomial and the list-color function of $…