发现好书期刊，享受阅读乐趣

海量图书期刊资源，随时随地畅享阅读乐趣

A sharp lower bound on the number of non-equivalent colorings of graphs of order <mml:math altimg=

n and maximum degree n−3" onerror="this.onerror=null;window.coverFallback&&coverFallback(this);">

A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n−3

Absil, Romain; Camby, Eglantine; Hertz, Alain; Mélot, Hadrien

期刊名称Discrete Applied Mathematics
作者Absil, Romain; Camby, Eglantine; Hertz, Alain; Mélot, Hadrien
印刷ISSN0166-218X
文件大小461.56KB
发表时间2016-7
DOI10.1016/j.dam.2016.06.025

← 返回【学霸图书馆】主页