default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDContributions to Discrete Mathematics, Volume 16
Volume 16, Number 1, 2021
- István Mezö, Chen-Ying Wang, Haiyan Guan:
The estimation of the zeros of some counting polynomials. 1-7 - Lucas Mol, Narad Rampersad:
Lengths of extremal square-free ternary words. 8-19 - Mircea Merca
:
Combinatorial interpretations of two identities of Guo and Yang. 20-27 - Jagannath Bhanja, Takao Komatsu, Ram Krishna Pandey:
Direct and inverse problems for restricted signed sumsets in integers. 28-46 - Daniel C. Slilaty:
Coloring permutation-gain graphs. 47-52 - Dhanalakshmi Ramalingam, Chinnappillai Durairajan:
Bounds on r-identifying codes in q-ary Lee space. 53-71 - Appattu Vallapil Prajeesh, Krishnan Paramasivam:
Note on group distance magicness on product graphs. 72-88 - Zeinab Montazeri, Nasrin Soltankhah:
k-Forcing number for Cartesian product of some graphs. 89-97 - Alyeah Alsairafi, Allen Herman:
Symmetric association schemes arising from abstract regular polytopes. 98-116 - Mircea Merca:
Fubini polynomials and integer partitions. 117-127 - Pascal Honvault:
Equivalent classes of degree sequences for triangulated polyhedra and their convex realization. 128-137 - Sizhong Zhou, Zhiren Sun:
A neighborhood condition for graphs to have restricted fractional (g, f)-factors. 138-149 - Hortensia Galeana-Sánchez, Eugenia O'Reilly Regueiro:
H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. 150-159 - Luca Ferrari:
Schröder partitions, Schröder tableaux and weak poset patterns. 160-184 - Anthony Bonato:
A survey of graph burning. 185-197
Volume 16, Number 2, 2021
- John Kenneth Truss, Edith Vargas-García:
Reconstructing the topology on monoids and polymorphism clones of reducts of the rationals. 1-22 - Martino Lupini:
Fraïssé theory and the Poulsen simplex. 23-35 - Michael Pinsker, Manuel Bodirsky:
Canonical functions: a proof via topological dynamics. 36-45 - Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
Conant's generalised metric spaces are Ramsey. 46-70 - Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Completing graphs to metric spaces. 71-89 - Claude Laflamme, Maurice Pouzet, Norbert Sauer, Robert E. Woodrow:
Siblings of an ℵ0-categorical relational structure. 90-127 - Lionel Nguyen Van Thé:
Problems Section BIRS Proceedings. 128-136
Volume 16, Number 3, 2021
- Baoyindureng Wu, Heping Zhang:
Graphs where each spanning tree has a perfect matching. 1-8 - Jin Hong Kim, Park Nari:
Flag vector pairs, fatness, and their bounds for 4-polytopes. 9-30 - Nadia Li, Wenchang Chu:
Bailey and Daum's q-Kummer Theorem and Extensions. 31-41 - Hery Randriamaro:
The Tutte Polynomial of Complex Reflection Groups. 42-64 - Longshu Wu, Qin Wang:
Degree conditions of nearly induced matching extendable graphs. 65-73 - Samir Shukla, Shuchita Goyal, Anurag Singh:
Homotopy Type of Independence Complexes of Certain Families of Graphs. 74-92 - Wei Gao, Yanling Shao:
Oriented unicyclic graphs with minimal skew Randić energy. 93-110 - Katherina Böhmova, Cristina Dalfó, Clemens Huemer:
New cyclic Kautz digraphs with optimal diameter. 111-124 - Antoine Deza, Jean-Baptiste Hiriart-Urruty, Lionel Pournin:
Polytopal balls arising in optimization. 125-138 - Abel Cabrera Martínez:
Starred Italian domination in graphs. 139-152 - Jesús González, Teresa I. Hoekstra-Mendoza:
On the homotopy type of complexes of graphs with bounded domination number. 139-160 - Jason I. Brown, Iain Beaton:
On the real roots of domination polynomials. 175-182
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.
last updated on 2025-06-29 20:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
