Chao Wen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Chao Wen has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Qiang Sun
School of Mathematical Science, Yangzhou University, Yangzhou 225002, China
3 shared publications - Chao Zhang
State Key Laboratory of Public Big Data, School of Mathematics and Statistics, Guizhou University, Guiyang 550025, China
2 shared publications - Jiahui Cao
School of Mathematics, Yangzhou University, Yangzhou 225002, P. R. China
1 shared publication - Jing He
School of Mathematics and Statistics, Guizhou University, Guiyang, Guizhou, China
1 shared publication - Liang Zhou
State Key Laboratory of Public Big Data, School of Mathematics and Statistics, Guizhou University, Guiyang 550025, P. R. China
1 shared publication - Yufan Yuan
School of Mathematics, Yangzhou University, Yangzhou 225002, P. R. China
1 shared publication
Latest Publications
- 2 June 2026
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
The chromatic number of the Cartesian product of signed graphs
In [ ], Vizing showed that the chromatic number of the Cartesian product of two graphs is equal to the larger one of the chromatic numbers of these two graphs. This result shows that the chromatic number of the Cartesian product of graphs is determined by its factors’ chromatic numbers. In this paper, we study the chromatic number of the Cartesian product of signed graphs. For signed graphs, we find that the chromatic number of the Cartesian product is also determined by its factors. For any two signed graphs [ ] and [ ], we have [ ]. Moreover, if [ ] is even, then [ ]. For the case [ ] is odd, there are graphs that satisfy [ ] and [ ] respectively.
- 2 June 2026
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
The chromatic number of the Cartesian product of signed graphs
In [ ], Vizing showed that the chromatic number of the Cartesian product of two graphs is equal to the larger one of the chromatic numbers of these two graphs. This result shows that the chromatic number of the Cartesian product of graphs is determined by its factors’ chromatic numbers. In this paper, we study the chromatic number of the Cartesian product of signed graphs. For signed graphs, we find that the chromatic number of the Cartesian product is also determined by its factors. For any two signed graphs [ ] and [ ], we have [ ]. Moreover, if [ ] is even, then [ ]. For the case [ ] is odd, there are graphs that satisfy [ ] and [ ] respectively.
- 4 November 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Coloring three graph classes with Δ - 1 colors
The Borodin-Kostochka conjecture states that every connected graph [ ] with [ ] satisfies [ ]. In this paper, we verify this conjecture for any [ ]-free graph [ ] (where a [ ] is a [ ] with a pendant edge), by further prohibiting induced subgraph HVN (where a [ ] is a [ ] together with one more vertex which is adjacent to exactly two vertices of [ ]), we verify this conjecture with [ ]. Furthermore, for any [ ]-free graph [ ] (where a [ ] is a [ ] with a pendant edge), we verify this conjecture with [ ].
- 4 November 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Coloring three graph classes with Δ - 1 colors
The Borodin-Kostochka conjecture states that every connected graph [ ] with [ ] satisfies [ ]. In this paper, we verify this conjecture for any [ ]-free graph [ ] (where a [ ] is a [ ] with a pendant edge), by further prohibiting induced subgraph HVN (where a [ ] is a [ ] together with one more vertex which is adjacent to exactly two vertices of [ ]), we verify this conjecture with [ ]. Furthermore, for any [ ]-free graph [ ] (where a [ ] is a [ ] with a pendant edge), we verify this conjecture with [ ].
- Open Access
- 1 January 2025
- Published by National Library of Serbia in Filomat
- Vol. 39 (16) , 5721-5731
Nowhere-zero flows in signed grid graphs
In 1983, Bouchet conjectured that every flow-admissible signed graph admits a nowhere-zero 6-flow. This conjecture remains unresolved even for signed planar graphs. In this paper, we prove that any flow-admissible signed grid graph, which is a special class of planar graphs, admits a nowhere-zero 6-flow.
- 1 January 2025
- Published by National Library of Serbia in Filomat
- Vol. 39 (16) , 5721-5731
Open AccessNowhere-zero flows in signed grid graphs
In 1983, Bouchet conjectured that every flow-admissible signed graph admits a nowhere-zero 6-flow. This conjecture remains unresolved even for signed planar graphs. In this paper, we prove that any flow-admissible signed grid graph, which is a special class of planar graphs, admits a nowhere-zero 6-flow.