F. Dong

activity

20152023

most citedExpression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs

36 citations · 70 across the 26 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)

Fengming Dong, Meiqiao Zhang

For a hypergraph $H$ , let $P (H, k)$ and $P_{l} (H, k)$ be its chromatic polynomial and list-color function respectively, and let $τ^{'} (H)$ be the least non-neg…

math.CO2022

On the size of matchings in 1-planar graph with high minimum degree

Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong

A matching of a graph is a set of edges without common end vertex. A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Recen…

math.CO2022★ 4 cited

An improved lower bound of $P (G, L) - P (G, k)$ for $k$ -assignments $L$

Fengming Dong, Meiqiao Zhang

Let $G = (V, E)$ be a simple graph with $n$ vertices and $m$ edges, $P (G, k)$ be the chromatic polynomial of $G$ , and $P (G, L)$ be the number of $L$ -colorings of $G$ for any $k$ -assignm…

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)

On the size of matchings in 1-planar graph with high minimum degree

An improved lower bound of P(G,L)−P(G,k) for k-assignments L

An improved lower bound of $P (G, L) - P (G, k)$ for $k$ -assignments $L$