Author:
Hatzel Meike,Wiederrecht Sebastian
Publisher
Springer International Publishing
Reference21 articles.
1. Arputhamary, I.A., Mercy, M.H.: An analytical discourse on strong edge coloring for interference-free channel assignment in interconnection networks. Wirel. Pers. Commun. 94(4), 2081–2094 (2017)
2. Cameron, K.: Induced matchings. Discret. Appl. Math. 24(1–3), 97–102 (1989)
3. Cameron, K., Sritharan, R., Tang, Y.: Finding a maximum induced matching in weakly chordal graphs. Discret. Math. 266(1–3), 133–142 (2003)
4. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51–229 (2006)
5. Chudnovsky, M., Scott, A., Seymour, P.: Induced subgraphs of graphs with large chromatic number. iii. long holes. Combinatorica 121, 1–16 (2016)