Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 305
Volume 305, December 2021
- Mikhail V. Goubko
, Alexander Veremyev:
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees. 1-9
- Junjiang Li, Guifu Su, Guanbang Song:
New comments on "A Hamilton sufficient condition for completely independent spanning tree". 10-15 - Abdullah Dean, Sean English, Tongyun Huang, Robert A. Krueger, Andy Lee, Mose Mizrahi, Casey Wheaton-Werle:
Firefighting on the hexagonal grid. 16-22 - Josep Fàbrega, Jaume Martí-Farré, Xavier Muñoz:
Uniform forcing and immune sets in graphs and hypergraphs. 23-33 - Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Finding densest k-connected subgraphs. 34-47
- Kathie Cameron:
A parity theorem about trees with specified degrees. 48-55
- Litao Guo, Gülnaz Boruzanli Ekinci:
Super connectivity of folded twisted crossed cubes. 56-63
- Arran Hamm, Paul Hazelton, Suzanna Thompson:
On Ramsey and star-critical Ramsey numbers for generalized fans versus nKm. 64-70 - Darine Al-Mniny:
Subdivisions of four blocks cycles in digraphs with large chromatic number. 71-75
- Yongfang Kou, Xiaomin Hu, Weihua Yang:
The clique distribution in powers of hypercubes. 76-85
- Adin Safokem, Issofa Moyouwou, Aurélien Y. Mekuko:
Axiomatizing the Public Good Index via merging and new arrival properties. 86-102
- Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
A simplified algorithm computing all s-t bridges and articulation points. 103-108
- Samir Zahirovic:
The power graph of a torsion-free group determines the directed power graph. 109-118 - Uriel Feige, Shimon Kogan:
Target set selection for conservative populations. 119-132 - Dongqin Cheng:
The h-restricted connectivity of balanced hypercubes. 133-141
- Pham Hoang Ha:
A note on the independence number, connectivity and k-ended tree. 142-144
- Jun Ge:
Effective resistances and spanning trees in the complete bipartite graph plus a matching. 145-153 - Dandan Fan, Sergey Goryainov, Huiqiu Lin:
On the (signless Laplacian) spectral radius of minimally k-(edge)-connected graphs for small k. 154-163 - Carl Johan Casselgren, Petros A. Petrosyan:
Improper interval edge colorings of graphs. 164-178 - Hong Zhang, Shuming Zhou, Jiafei Liu, Qianru Zhou, Zhengqin Yu:
Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern. 179-190
- Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
Local WL invariance and hidden shades of regularity. 191-198
- Joachim Gudmundsson, Julián Mestre, Seeun William Umboh:
Bounded-degree light approximate shortest-path trees in doubling metrics. 199-204
- Esther Galby, Felix Mann, Bernard Ries:
Reducing the domination number of (P3+kP2)-free graphs via one edge contraction. 205-210 - M. Krivoshapko, Maksim Zhukovskii:
Maximum induced forests in random graphs. 211-213 - Vladimir Gurvich:
Balanced flows for transshipment problems. 214-220
- Ming Xu, Xiaoyan Cheng, Yuansheng Tang:
On the characterization of some algebraically defined bipartite graphs of girth eight. 221-232 - Guillaume Ducoffe, Alexandru Popa:
The b-Matching problem in distance-hereditary graphs and beyond. 233-246 - Jeandré Boshoff, Adriana Roux:
The localization game on Cartesian products. 247-259
- Bhawani Sankar Panda, Subir Kumar Ghosh:
Preface: CALDAM 2018. 260 - Manjanna Basappa:
Line segment disk cover. 261-271 - Piotr Wojciechowski, K. Subramani, Matthew D. Williamson:
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. 272-294 - Farah Chanchary, Anil Maheshwari, Michiel Smid:
Window queries for intersecting objects, maximal points and approximations using coresets. 295-310 - Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions. 311-328 - Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
On the tractability of (k, i)-coloring. 329-339 - Sandip Das, Harmender Gahlawat:
Variations of cops and robbers game on grids. 340-349 - Sizhong Zhou:
Binding numbers and restricted fractional (g, f)-factors in graphs. 350-356 - S. Monikandan, A. Anu:
Reconstruction number of graphs with unique pendant vertex. 357-365 - Bodo Manthey, Victor M. J. J. Reijnders:
Probabilistic properties of highly connected random geometric graphs. 366-376
a service of 
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-08-04 19:02 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:
