Search Results
Press , New York , 1973 , 55 – 63 . [4] H . Bruhn and F . Joos . A stronger bound for the strong chromatic index . Combinatorics, Probability and Computing , 27 : 21 – 43 , 2017 . [5] L . Bezegová , B . Lužar , M . Mockovčiakova , R
. [11] Mathematical Reviews MR0427112 (55 #148) . [12] Oxley , J . The Contributions of Dominic Welsh to Matroid Theory . In Geo_rey Grimmett and Colin McDiarmid (eds.) , Combinatorics, Complexity, and Chance. A Tribute to Dominic Welsh
arithmetic functions , vol. 126 of Pure Appl. Math ., Marcel Dekker . 1989 . [15] Stanley , R. P . Enumerative combinatorics . Vol. 1., vol. 49 of Camb. Stud. Adv. Math . Cambridge : Cambridge University Press , 1997 . [16] Subbarao , M. V . On
triangle free coloring . AKCE International Journal of Graphs and Combinatorics 9 , 2 ( 2012 ), 169 – 186 . [13] SZABÓ , S ., AND ZAVÁLNIJ , B . Reducing graph coloring to clique search . Asia Pacific Journal of Mathematics 3 ( 2016 ), 64 – 85