Scientific Research
Working-Papers
-
Graph coloring: planar graph
Complex networks:
Algorithms on graphs
Paper Publications
More>-
杨帆. 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz. Discrete Mathematics, 346, 2024.
-
杨帆. <p>The total coloring of K-5-minor-free graphs</p>. European Journal of Combinatorics, 102, 2022.
-
冯洁茹. On generalized neighbor sum distinguishing index of planar graphs. DiscreteMathematicsAlgorithmsandApplications, 14, 2024.
-
荆飞. Toward Structural Controllability and Predictability in Directed Networks. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022.
-
冯洁茹. The edge colorings of K-5-minor free graphs. Discrete Mathematics, 344, 2021.
-
牛亚伟. Information spreading with relative attributes on signed networks. Information Sciences, 551, 54, 2021.
-
扈琳娜. LIST EDGE COLORING OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 41, 199, 2022.
-
宋繁鹏. Transcendental behavior and disturbance behavior favor human development. Applied Mathematics and Computation (New York), 378, 2021.
Patents
- No content
Published Books
- No content
Research Projects
Research Team
- No content