« Back to Record
Citation APA

Absil, R., Camby, E., Hertz, A., & Melot, H. (2018). A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n−3. Discrete applied mathematics, 234, 3-11. doi:10.1016/j.dam.2016.06.025


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/273648

Absil, R., Camby, E., Hertz, A., & Melot, H. (2018). A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n−3. Discrete applied mathematics, 234, 3-11. doi:10.1016/j.dam.2016.06.025