The following pages link to Fengming Dong (Q490408):
Displayed 45 items.
- (Q3462420) (← links)
- Bounds For The Real Zeros of Chromatic Polynomials (Q3608333) (← links)
- (Q3974300) (← links)
- On chromatic uniqueness of two infinite families of graphs (Q4201394) (← links)
- (Q4346040) (← links)
- (Q4379744) (← links)
- (Q4495689) (← links)
- (Q4529518) (← links)
- (Q4529520) (← links)
- Two Results on Real Zeros of Chromatic Polynomials (Q4650641) (← links)
- (Q4717030) (← links)
- (Q4820523) (← links)
- (Q4944827) (← links)
- Problems on chromatic polynomials of hypergraphs (Q4957990) (← links)
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree (Q5046627) (← links)
- New expressions for order polynomials and chromatic polynomials (Q5110675) (← links)
- Graph Theory (Q5245252) (← links)
- Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs (Q5272634) (← links)
- (Q5289580) (← links)
- (Q5313291) (← links)
- On the largest outscribed equilateral triangle (Q5350620) (← links)
- (Q5386171) (← links)
- On Zero-Free Intervals in $(1,2)$ of Chromatic Polynomials of Some Families of Graphs (Q5392898) (← links)
- (Q5753976) (← links)
- On Graphs Having No Chromatic Zeros in (1,2) (Q5757393) (← links)
- (Q5851396) (← links)
- DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES (Q5851750) (← links)
- Foundations of the chromatic polynomial (Q5890012) (← links)
- Structures and chromaticity of extremal 3-colourable sparse graphs (Q5956100) (← links)
- A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs (Q5957711) (← links)
- An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) (Q6038583) (← links)
- DP color functions versus chromatic polynomials (II) (Q6047960) (← links)
- ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ (Q6047969) (← links)
- Zip product of graphs and crossing numbers (Q6055394) (← links)
- Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II (Q6080166) (← links)
- Introduction to Graph Theory (Q6085528) (← links)
- A new note on 1-planar graphs with minimum degree 7 (Q6204300) (← links)
- Formulas counting spanning trees in line graphs and their extensions (Q6322240) (← links)
- Polynomials related to chromatic polynomials (Q6344805) (← links)
- Express the number of spanning trees in term of degrees (Q6370327) (← links)
- $Z_{DP}(n)$ is upperly bounded by $n^2-(n+3)/2$ (Q6373175) (← links)
- Compare list-color functions of hypergraphs with their chromatic polynomials (I) (Q6435254) (← links)
- The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions (Q6435630) (← links)
- On the maximum local mean order of sub-k-trees of a k-tree (Q6452030) (← links)
- On the colorability of bi-hypergraphs (Q6454509) (← links)