default search action
Contributions to Discrete Mathematics, Volume 17
Volume 17, Number 1, 2022
- Chinnavedi Rangasamy, R. Sangeetha:
Kn(λ) is fully {P5, C6}-decomposable. 1-12 - Dongkyu Lim:
A note on the fully degenerate Bell polynomials of the second kind. 13-30 - Senlin Wu, Keke Zhang, Chan He:
Homothetic covering of convex hulls of compact convex sets. 31-37 - Azam Rajabi, Ahmad Erfanian, Ali Azimi:
The endomorphisms monoids of Helm graph and its generalization. 38-55 - Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour:
Pushes in words-a primitive sorting algorithm. 56-69 - Maurice Pouzet, Nicolas M. Thiéry:
Some relational structures with polynomial growth and their associated algebras II. Finite generation. 70-108 - Maurice Pouzet, Imed Zaguia:
Metric properties of incomparability graphs with an emphasis on paths. 109-141
Volume 17, Number 2, 2022
- Paola Bonacini, Selda Küçükçifçi, Salvatore Milici, Emine Sule Yazici:
On uniformly resolvable $(C_4,K_{1,3})$-designs. 1-22 - Miklós Eper, Jeno Szirmai:
Coverings with congruent and non-congruent hyperballs generated by doubly truncated Coxeter orthoschemes. 23-40 - David Richter:
Some notes on generic rectangulations. 41-66 - Jacob Anthony White:
Brooks' theorem for 2-fold coloring. 67-76 - Zia Ullah Khan, Xiao-Dong Zhang:
On $D_{\alpha}$ spectrum of connected graphs. 77-95 - Abdulaziz M. Alanazi, Bashair Alenazi, William J. Keith, Augustine O. Munagi:
Refining overpartitions by properties of non-overlined parts. 96-111 - Anthony D. Forbes, Terry S. Griggs:
Designs for graphs with six vertices and ten edges - II. 112-136 - Arthur H. Busch, Mohammed A. Mutar, Daniel C. Slilaty:
Hamilton cycles in bidirected complete graphs. 137-149 - Craig S. Kaplan:
Heesch numbers of unmarked polyforms. 150-171 - Abderrahim Boussaïri, Soufiane Lakhlifi, Imane Talbaoui:
simplicity index of tournaments. 172-186
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.