default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDContributions to Discrete Mathematics, Volume 12
Volume 12, Number 1, 2017
- Thomas Jahn:
Geometric Algorithms for Minimal Enclosing Disks in Strictly Convex Normed Planes. - Babak Samadi, Hamid R. Golmohammadi, Abdollah Khodkar:
Bounds on several versions of restrained domination number. - Olivia Yao, Chao Gu, Yinghua Ma:
Congruences modulo powers of 2 and 3 for a restricted binary partition function a la Andrews and Lewis. - Shuichi Tsukuda:
Independence complexes and incidence graphs. - Margaret-Ellen Messinger:
Closing the Gap: Eternal Domination on 3 x n Grids. - Samuel Coskey, Paul Ellis:
The conjugacy problem for automorphism groups of homogeneous digraphs. - Paola Bonacini, Lucia Marino:
On the spectrum of octagon quadrangle systems of any index. - Mario Gionfriddo, Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi:
α-Resolvable λ-fold G-designs. - Manouchehr Zaker:
First-Fit coloring of Cartesian product graphs and its defining sets. - Marcin Peczarski:
Comments on the Golden Partition Conjecture. - Anthony Bonato, Gary MacGillivray:
Characterizations and algorithms for generalized Cops and Robbers games. - Naoki Matsumoto:
Conjectures on uniquely 3-edge-colorable graphs. - Paola Bonacini, Maria Di Giovanni, Mario Gionfriddo, Lucia Marino, Antoinette Tripodi:
The Spectrum of Balanced P^(3)(1, 5)-Designs. - K. M. Kathiresan, S. Sabarimalai Madha:
Star super edge magic deficiency of graphs. - Anurag Bishnoi, Ferdinand Ihringer:
Some non-existence results for distance-$j$ ovoids in small generalized polygons.
Volume 12, Number 2, 2017
- R. Lenin, Kumarappan Kathiresan, Martin Baca:
The Forcing Strong Metric Dimension of a Graph. - Randy Davila, Caleb Fast, Michael A. Henning, Franklin Kenter:
Lower Bounds on the Distance Domination Number of a Graph. - Alex Fink, Richard K. Guy:
The Outercoarseness of the n-cube. - Megha Goyal:
On combinatorial extensions of Rogers-Ramanujan type identities. - Hong Gao, Huiping Cao, Yuansheng Yang:
On the total signed domination number of the Cartesian product of paths. - Kevin N. Vander Meulen, Adam Van Tuyl:
Shellability, vertex decomposability, and lexicographical products of graphs. - Sharareh Alipour, Amir Jafari:
On Chromatic Number of General Kneser Graphs. - P. Anusha Devi, S. Monikandan:
Degree Associated Reconstruction Parameters of Total Graphs. - Michael A. Henning, William Klostermeyer, Gary MacGillivray:
Bounds for the $m$-Eternal Domination Number of a Graph. - Tomás Vetrík:
On the metric dimension of circulant graphs with $4$ generators. - Meenakshi Rana, J. K. Sareen:
Split (n + t)-color partitions and 2-color F-partitions. - Pedro Martín, Horst Martini, Margarita Spirova:
Ball hulls, ball intersections, and 2-center problems for gauges. - Marcin Anholcer, Sylwia Cichacz:
Group Irregular Labelings of Disconnected Graphs. - Domingos Moreira Cardoso, Charles Dominic, Lukasz Witkowski, Marcin Witkowski:
On Cops and Robbers on $G^{\Xi}$ and cop-edge critical graphs. - Gabe Cunningham, Mark Mixer:
Internal and external duality in abstract polytopes. - Norbert Sauer, Imed Zaguia:
Permutations avoiding connected graphs.
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-04-10 21:09 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:
