Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference14 articles.
1. A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n−3;Absil;Discrete Appl. Math.,2018
2. On Engel’s inequality for bell numbers;Alzer;J. Integer Seq.,2019
3. G. Devillez, P. Hauweele, H. Mélot, PHOEG Helps to Obtain Extremal Graphs, in: B. Fortz, M. Labbé (Eds.), Operations Research Proceedings 2018 (GOR Gesellschaft Fuer Operations Research E.V. Sept. 12-14 2019, Springer, Cham, p. 251, (Paper 32).
4. Graph Theory;Diestel,2017
5. On rigid circuit graphs;Dirac;Abhandlungen Aus Dem Mathematischen Seminar Der Universität Hamburg,1961
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献