default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 232
Volume 232, December 2017
- Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
On the double Roman domination in graphs. 1-7 - Yasmeen Akhtar, Soumen Maity:
Mixed covering arrays on 3-uniform hypergraphs. 8-22 - Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
NIC-planar graphs. 23-40 - Ravindra B. Bapat, Masoud Karimi
, Jia-Bao Liu:
Kirchhoff index and degree Kirchhoff index of complete multipartite graphs. 41-49 - Julien Bensmail, Soumen Nandi, Sagnik Sen:
On oriented cliques with respect to push operation. 50-63 - Sergio Bermudo:
On the differential and Roman domination number of a graph with minimum degree two. 64-72 - Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin:
Burning a graph is hard. 73-87 - Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau:
A Vizing-like theorem for union vertex-distinguishing edge coloring. 88-98 - Axel Brandt, Jennifer Diemunsch, Catherine Erbes, J. Legrand, Casey Moffatt:
A robber locating strategy for trees. 99-106 - Jihoon Choi, Soogang Eoh, Suh-Ryung Kim, Sojung Lee:
On (1, 2)-step competition graphs of bipartite tournaments. 107-115 - Italo J. Dejter, Oscar Tomaiconza:
Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3. 116-124 - Uéverton dos Santos Souza, Fábio Protti:
Tractability, hardness, and kernelization lower bound for and/or graph solution. 125-133 - Mitre Costa Dourado, Aline R. da Silva:
Inapproximability results and bounds for the Helly and Radon numbers of a graph. 134-141 - Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed:
Eccentricity approximating trees. 142-156 - Farzad Farnoud Hassanzadeh, Olgica Milenkovic, Gregory J. Puleo, Lili Su:
Computing similarity distances between rankings. 157-175 - Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes:
Maintaining balanced trees for structured distributed streaming systems. 176-188 - Ivan Gutman, Shuchao Li, Wei Wei:
Cacti with n-vertices and t cycles having extremal Wiener index. 189-200 - Dan Hu, Xueliang Li, Xiaogang Liu, Shenggui Zhang:
The von Neumann entropy of random multipartite graphs. 201-206
- Mustapha Aouchiche, Pierre Hansen:
The geometric-arithmetic index and the chromatic number of connected graphs. 207-212 - Yibin Fang, Yubin Gao:
Counterexamples to the conjecture on orientations of graphs with minimum Wiener index. 213-220 - Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
A note on breaking small automorphisms in graphs. 221-225 - Chunhui Lai:
On the size of graphs without repeated cycle lengths. 226-229 - Chuanqi Xiao, Haiyan Chen, Andrei M. Raigorodskii:
A connection between the Kekulé structures of pentagonal chains and the Hosoya index of caterpillar trees. 230-234
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 2024-10-02 20:33 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:
