$K_{s,t}$-Polychromatic Edge-Colorings of Complete Bipartite Graphs
Received:November 08, 2024  
Key Words: edge-coloring   polychromatic edge-coloring of subgraph   bipartite graph  
Fund Project:Supported by the National Natural Science Foundation of China (Grant No.12071265) and the Natural Science Foundation of Shandong Province (Grant No.ZR2025MS11).
Author NameAffiliation
Shiqian WANG School of Mathematics and Statistics, Shandong Normal University, Shandong 250358, P. R. China 
Xia ZHANG School of Mathematics and Statistics, Shandong Normal University, Shandong 250358, P. R. China 
Hits: 25
Download times: 32
Abstract:
      
Citation:
DOI:10.3770/j.issn:2095-2651.2025.06.001
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.