Fengming Dong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Fengming Dong has a total of 115 co-authors. Here are the top co-authors by number of shared publications:
- Meiqiao Zhang
School of Mathematical Sciences Xiamen University P.R. China
12 shared publications K.M. Koh
Department of Mathematics, National University of Singapore, Singapore 117543, Singapore
11 shared publications- Zhangdong Ouyang
Department of Mathematics Hunan First Normal University 410205 Changsha P.R.China
11 shared publications - Yuanqiu Huang
Department of Mathematics Hunan Normal University 410081 Changsha P.R.China
10 shared publications - Jun Ge
School of Mathematical Sciences, Sichuan Normal University, Chengdu, China
8 shared publications K.L. Teo
Institute of Fundamental Sciences (Mathematics), Massey University, Private Bag 11222, Palmerston North, New Zealand
6 shared publications
Latest Publications
- 13 April 2026
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 51 (3) , 37
DP color functions of hypergraphs
- 13 April 2026
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 51 (3) , 37
DP color functions of hypergraphs
- Open Access
DP color functions versus chromatic polynomials for hypergraphs (I)
For a hypergraph $\mathcal{H}$, the DP color function $P_{DP}(\mathcal{H},k)$ of $\mathcal{H}$ is an extension of the chromatic polynomial $P(\mathcal{H},k)$ with the property that $P_{DP}(\mathcal{H},k) \le P(\mathcal{H},k)$ for all positive integers $k$. In this article, we primarily investigate the influence of the minimum cycle length on the DP-coloring function, as well as the relevant properties of the DP-coloring function of $\mathcal{H} \vee K_p$ (i.e., the join of $\mathcal{H}$ and $K_p$). We show that for any linear and uniform hypergraph $\mathcal H$ with even girth, there exists a positive integer $N$ such that $P_{DP} (\mathcal H, k) < P(\mathcal H, k)$ for all integers $k\ge N$, and this conclusion also holds for any hypergraph $\mathcal{H}$ that contains an edge $e$ with the properties that $\mathcal{H}-e$ has exactly $|e|-1$ components and any shortest cycle in $\mathcal{H}$ containing $e$ is an even cycle. For the hypergraph $\mathcal{H}\vee K_p$, we prove that if $\mathcal{H}$ is uniform, then there exist positive integers $p$ and $N$ such that $P_{DP}(\mathcal{H} \vee K_p,k)=P(\mathcal{H} \vee K_p,k)$ holds for all integers $k\geq N$.Open AccessDP color functions versus chromatic polynomials for hypergraphs (I)
For a hypergraph $\mathcal{H}$, the DP color function $P_{DP}(\mathcal{H},k)$ of $\mathcal{H}$ is an extension of the chromatic polynomial $P(\mathcal{H},k)$ with the property that $P_{DP}(\mathcal{H},k) \le P(\mathcal{H},k)$ for all positive integers $k$. In this article, we primarily investigate the influence of the minimum cycle length on the DP-coloring function, as well as the relevant properties of the DP-coloring function of $\mathcal{H} \vee K_p$ (i.e., the join of $\mathcal{H}$ and $K_p$). We show that for any linear and uniform hypergraph $\mathcal H$ with even girth, there exists a positive integer $N$ such that $P_{DP} (\mathcal H, k) < P(\mathcal H, k)$ for all integers $k\ge N$, and this conclusion also holds for any hypergraph $\mathcal{H}$ that contains an edge $e$ with the properties that $\mathcal{H}-e$ has exactly $|e|-1$ components and any shortest cycle in $\mathcal{H}$ containing $e$ is an even cycle. For the hypergraph $\mathcal{H}\vee K_p$, we prove that if $\mathcal{H}$ is uniform, then there exist positive integers $p$ and $N$ such that $P_{DP}(\mathcal{H} \vee K_p,k)=P(\mathcal{H} \vee K_p,k)$ holds for all integers $k\geq N$. - Open Access
A neighborhood union condition for the existence of a spanning tree without samll degree vertices
For an integer k\ge2, a [2,k]-ST of a connected graph G is a spanning tree of G in which there are no vertices of degree between 2 and k. A [2,k]-ST is a natural extension of a homeomorphically irreducible spanning tree (HIST), which is a spanning tree without vertices of degree 2. In this paper, we give a neighborhood union condition for the existence of a [2,k]-ST in G. We generalize a known degree sum condition that guarantees the existence of a [2,k]-ST in G.
Open AccessA neighborhood union condition for the existence of a spanning tree without samll degree vertices
For an integer k\ge2, a [2,k]-ST of a connected graph G is a spanning tree of G in which there are no vertices of degree between 2 and k. A [2,k]-ST is a natural extension of a homeomorphically irreducible spanning tree (HIST), which is a spanning tree without vertices of degree 2. In this paper, we give a neighborhood union condition for the existence of a [2,k]-ST in G. We generalize a known degree sum condition that guarantees the existence of a [2,k]-ST in G.
- 3 July 2025
- Published by Springer Nature
- p. 283-287
Chromatically Equivalent Chordal Graphs
- Open Access
The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity
A 1-planar graph is a graph which has a drawing on the plane such that each edge is crossed at most once. If a 1-planar graph is drawn in that way, the drawing is called a {\it 1-plane graph}. A graph is maximal 1-plane (or 1-planar) if no additional edge can be added without violating 1-planarity or simplicity. It is known that any maximal 1-plane graph is $k$-connected for some $k$ with $2\le k\le 7$. Recently, Huang et al. proved that any maximal 1-plane graph with $n$ ($\ge 5$) vertices has at least $\lceil\frac{7}{3}n\rceil-3$ edges, which is tight for all integers $n\ge 5$. In this paper, we study $k$-connected maximal 1-plane graphs for each $k$ with $3\le k\le 7$, and establish a lower bound for their crossing numbers and a lower bound for their edge numbers, respectively.Open AccessThe minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity
A 1-planar graph is a graph which has a drawing on the plane such that each edge is crossed at most once. If a 1-planar graph is drawn in that way, the drawing is called a {\it 1-plane graph}. A graph is maximal 1-plane (or 1-planar) if no additional edge can be added without violating 1-planarity or simplicity. It is known that any maximal 1-plane graph is $k$-connected for some $k$ with $2\le k\le 7$. Recently, Huang et al. proved that any maximal 1-plane graph with $n$ ($\ge 5$) vertices has at least $\lceil\frac{7}{3}n\rceil-3$ edges, which is tight for all integers $n\ge 5$. In this paper, we study $k$-connected maximal 1-plane graphs for each $k$ with $3\le k\le 7$, and establish a lower bound for their crossing numbers and a lower bound for their edge numbers, respectively. - 18 April 2025
- Published by Wiley in Journal of Graph Theory
- Vol. 110 (1) , 72-81
4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected
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 chordal graphs and show that all such graphs are Hamiltonian‐connected. A crucial tool used in our proof is a characteristic of 1‐planar 4‐trees.
- 18 April 2025
- Published by Wiley in Journal of Graph Theory
- Vol. 110 (1) , 72-81
4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected
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 chordal graphs and show that all such graphs are Hamiltonian‐connected. A crucial tool used in our proof is a characteristic of 1‐planar 4‐trees.
- Open Access
DP color functions of hypergraphs
In this article, we introduce the DP color function of a hypergraph, based on the DP coloring introduced by Bernshteyn and Kostochka, which is the minimum value where the minimum is taken over all its k-fold covers. It is an extension of its chromatic polynomial. we obtain an upper bound for the DP color functions of hypergraphs when hypergraphs are connected r-uniform hypergraphs for any r greater than one. The upper bound is attained if and only if the hypergraph is a r-uniform hypertree. We also show the cases of the DP color function equal to its chromatic polynomial. These conclusions coincide with the known results of graphs.
Open AccessDP color functions of hypergraphs
In this article, we introduce the DP color function of a hypergraph, based on the DP coloring introduced by Bernshteyn and Kostochka, which is the minimum value where the minimum is taken over all its k-fold covers. It is an extension of its chromatic polynomial. we obtain an upper bound for the DP color functions of hypergraphs when hypergraphs are connected r-uniform hypergraphs for any r greater than one. The upper bound is attained if and only if the hypergraph is a r-uniform hypertree. We also show the cases of the DP color function equal to its chromatic polynomial. These conclusions coincide with the known results of graphs.
- Open Access
Determining the minimum size of maximal 1-plane graphs
A 1-plane graph is a graph together with a drawing in the plane in such a way that each edge is crossed at most once. A 1-plane graph is maximal if no edge can be added without violating either 1-planarity or simplicity. Let $m(n)$ denote the minimum size of a maximal $1$-plane graph of order $n$. Brandenburg et al. established that $m(n)\ge 2.1n-\frac{10}{3}$ for all $n\ge 4$, which was improved by Barát and Tóth to $m(n)\ge \frac{20}{9}n-\frac{10}{3}$. In this paper, we confirm that $m(n)=\left\lceil\frac{7}{3}n\right\rceil-3$ for all $n\ge 5$.Open AccessDetermining the minimum size of maximal 1-plane graphs
A 1-plane graph is a graph together with a drawing in the plane in such a way that each edge is crossed at most once. A 1-plane graph is maximal if no edge can be added without violating either 1-planarity or simplicity. Let $m(n)$ denote the minimum size of a maximal $1$-plane graph of order $n$. Brandenburg et al. established that $m(n)\ge 2.1n-\frac{10}{3}$ for all $n\ge 4$, which was improved by Barát and Tóth to $m(n)\ge \frac{20}{9}n-\frac{10}{3}$. In this paper, we confirm that $m(n)=\left\lceil\frac{7}{3}n\right\rceil-3$ for all $n\ge 5$. - Open Access
A study on $T$-equivalent graphs
In his article [J. Comb. Theory Ser. B 16 (1974), 168-174], Tutte called two graphs $T$-equivalent (i.e., codichromatic) if they have the same Tutte polynomial and showed that graphs $G$ and $G'$ are $T$-equivalent if $G'$ is obtained from $G$ by flipping a rotor (i.e., replacing it by its mirror) of order at most $5$, where a rotor of order $k$ in $G$ is an induced subgraph $R$ having an automorphism $ψ$ with a vertex orbit $\{ψ^i(u): i\ge 0\}$ of size $k$ such that every vertex of $R$ is only adjacent to vertices in $R$ unless it is in this vertex orbit. In this article, we first show the above result due to Tutte can be extended to a rotor $R$ of order $k\ge 6$ if the subgraph of $G$ induced by all those edges of $G$ which are not in $R$ satisfies certain conditions. Also, we provide a new method for generating infinitely many non-isomorphic $T$-equivalent pairs of graphs.Open AccessA study on $T$-equivalent graphs
In his article [J. Comb. Theory Ser. B 16 (1974), 168-174], Tutte called two graphs $T$-equivalent (i.e., codichromatic) if they have the same Tutte polynomial and showed that graphs $G$ and $G'$ are $T$-equivalent if $G'$ is obtained from $G$ by flipping a rotor (i.e., replacing it by its mirror) of order at most $5$, where a rotor of order $k$ in $G$ is an induced subgraph $R$ having an automorphism $ψ$ with a vertex orbit $\{ψ^i(u): i\ge 0\}$ of size $k$ such that every vertex of $R$ is only adjacent to vertices in $R$ unless it is in this vertex orbit. In this article, we first show the above result due to Tutte can be extended to a rotor $R$ of order $k\ge 6$ if the subgraph of $G$ induced by all those edges of $G$ which are not in $R$ satisfies certain conditions. Also, we provide a new method for generating infinitely many non-isomorphic $T$-equivalent pairs of graphs. - Open Access
Partial domination of middle graphs
For any graph $G=(V,E)$, a subset $S\subseteq V$ is called {\it an isolating set} of $G$ if $V\setminus N_G[S]$ is an independent set of $G$, where $N_G[S]=S\cup N_G(S)$, and {\it the isolation number} of $G$, denoted by $ι(G)$, is the size of a smallest isolating set of $G$. In this article, we show that the isolation number of the middle graph of $G$ is equal to the size of a smallest maximal matching of $G$.Open AccessPartial domination of middle graphs
For any graph $G=(V,E)$, a subset $S\subseteq V$ is called {\it an isolating set} of $G$ if $V\setminus N_G[S]$ is an independent set of $G$, where $N_G[S]=S\cup N_G(S)$, and {\it the isolation number} of $G$, denoted by $ι(G)$, is the size of a smallest isolating set of $G$. In this article, we show that the isolation number of the middle graph of $G$ is equal to the size of a smallest maximal matching of $G$.