Fei Huang

Orcid: 0000-0001-9891-9215

Affiliations:
  • Zhengzhou University, School of Mathematics and Statistics, Henan, China


According to our database1, Fei Huang authored at least 15 papers between 2014 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Rainbow Pancyclicity and Panconnectivity of Strongly Edge-Colored Graphs.
Graphs Comb., February, 2025

Properly colored even cycles in edge-colored complete balanced bipartite graphs.
Discret. Math., 2025

2024
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs.
Discret. Appl. Math., March, 2024

Matchings in bipartite graphs with a given number of cuts.
Discret. Appl. Math., 2024

Bipartite cacti with extremal matching energy.
Appl. Math. Comput., 2024

2023
Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete Graphs.
Graphs Comb., December, 2023

Rainbow vertex pair-pancyclicity of strongly edge-colored graphs.
Discret. Math. Theor. Comput. Sci., 2023

2022
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three.
Discret. Math., 2022

Properly colored 2-factors of edge-colored complete bipartite graphs.
Discret. Math., 2022

2020
A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs.
SIAM J. Discret. Math., 2020

Matchings in graphs with a given number of cuts.
Discret. Appl. Math., 2020

2019
Paths and trails in edge-colored weighted graphs.
Theor. Comput. Sci., 2019

On strong proper connection number of cubic graphs.
Discret. Appl. Math., 2019

Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles.
Discret. Appl. Math., 2019

2014
On the vertex-arboricity of K<sub>5</sub>-minor-free graphs of diameter 2.
Discret. Math., 2014


  Loading...