More Like this

1. Class-Imbalanced Learning on Graphs: A Survey

   https://doi.org/10.1145/3718734  

   Ma, Yihong; Tian, Yijun; Moniz, Nuno; Chawla, Nitesh V (August 2025, ACM Computing Surveys)

   Rapid advancement in machine learning is increasing the demand for effective graph data analysis. However, real-world graph data often exhibits class imbalance, leading to poor performance of standard machine learning models on underrepresented classes. To address this,Class-ImbalancedLearning onGraphs (CILG) has emerged as a promising solution that combines graph representation learning and class-imbalanced learning. This survey provides a comprehensive understanding of CILG’s current state-of-the-art, establishing the first systematic taxonomy of existing work and its connections to traditional imbalanced learning. We critically analyze recent advances and discuss key open problems. A continuously updated reading list of relevant articles and code implementations is available athttps://github.com/yihongma/CILG-Papers. 

   more » « less
2. Double Vizing fans in critical class two graphs

   https://doi.org/10.1002/jgt.22903  

   Cao, Yan; Chen, Guantao; Qi, Xuli (May 2023, Journal of Graph Theory)

   Abstract Let be a simple graph and be the chromatic index of . We call a ‐critical graphif for every edge of , where is maximum degree of . Let be an edge of ‐critical graph and be an (proper) edge ‐coloring of . Ane‐fanis a sequence of alternating vertices and distinct edges such that edge is incident with or , is another endvertex of and is missing at a vertex before for each with . In this paper, we prove that if , where and denote the degrees of vertices and , respectively, then colors missing at different vertices of are distinct. Clearly, a Vizing fan is an ‐fan with the restricting that all edges being incident with one fixed endvertex of edge . This result gives a common generalization of several recently developed new results on multifan, double fan, Kierstead path of four vertices, and broom. By treating some colors of edges incident with vertices of low degrees as missing colors, Kostochka and Stiebitz introduced ‐fan. In this paper, we also generalize the ‐fan from centered at one vertex to one edge. 

   more » « less
3. Coarse geometry of pure mapping class groups of infinite graphs

   https://doi.org/10.1016/j.aim.2022.108836  

   Domat, George; Hoganson, Hannah; Kwak, Sanghoon (January 2023, Advances in Mathematics)
4. Class-Ordered LPA: An Incremental-Search Algorithm for Weighted Colored Graphs

   https://doi.org/10.1109/IROS51168.2021.9636736  

   Lim, Jaein; Salzman, Oren; Tsiotras, Panagiotis (September 2021, IEEE/RSJ International Conference on Intelligent Robots and Systems)
5. Overfullness of critical class 2 graphs with a small core degree

   https://doi.org/10.1016/j.jctb.2022.04.006  

   Cao, Yan; Chen, Guantao; Shan, Songling (September 2022, Journal of Combinatorial Theory, Series B)