Incidence Coloring on Hypercubes
Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, and Ro-Yu Wu
Theoretical Computer Science, Vol. 557, (2014) pp. 59-65.

The above article has been cited by the articles listed below.
  1. Alexander Chane Shiau, Tzong-Huei Shiau, Yue-Li Wang, Incidence coloring of Cartesian product graphs, Information Processing Letters 115 (2015) 765-768. (*)

  2. Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu, Corrigendum to "Incidence coloring of Cartesian product graphs" [Theoret. Comput. Sci. 557 (2014) 59--65] , Theoretical Computer Science 651 (2016) 87-88. (*)

  3. Petr Gregor, Borut Luzar, Roman Sotak, On incidence coloring conjecture in Cartesian products of graphs, Discrete Applied Mathematics 213 (2016) 93-100. (*)

  4. Eric Sopena, The Incidence Coloring Page

  5. Cheng-Kuan Lin, Liang Ma, Jianxi Fan, Lih-Hsing Hsu, Yuan-Hsiang Teng, The conditional-(g,d,k)-connectivity and conditional-(g,d,k)-edge-connectivity on the hypercubes, Fundamenta Informaticae 173 (2020) 33-45. (*)

  6. Huimin Bi, Xin Zhang, Incidence coloring of Mycielskians with fast algorithm, Theoretical Computer Science 878-879 (2021) 1-10. (*)

  7. Mahsa Mozafari-Nia, Moharram N. Iradmusa, On incidence coloring of graph fractional powers, Opuscula Mathematica 43(1) (2023) 109-123. (*)

  8. Mahsa Mozafari-Nia, Moharram N. Iradmusa, Simultaneous coloring of vertices and incidences of hypercubes, Communications in Combinatorics and Optimization 9(1) (2024) 67-77. (*)

Times cited: 7 (from Web of Science)