default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 302
Volume 302, October 2021
- Michael A. Henning, Anders Yeo
:
A new upper bound on the total domination number in graphs with minimum degree six. 1-7 - Alexandr V. Kostochka, Xujun Liu:
Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs. 8-15 - Wei Li:
On the matching and permanental polynomials of graphs. 16-23 - Nastja Cepak:
Infinite classes of generalised complete permutations. 24-33 - Naoki Matsumoto, Yumiko Ohno:
Achromatic number and facial achromatic number of connected locally-connected graphs. 34-41
- Xing Feng, Jun Ge:
A conjecture on the lower bound of the signed edge domination number of 2-connected graphs. 42-45
- Alan M. Frieze, Tomasz Tkocz:
Shortest paths with a cost constraint: A probabilistic analysis. 46-53 - Sylwia Cichacz, Karol Suchan:
Minimum k-critical bipartite graphs. 54-66 - Zana Kovijanic Vukicevic, Sasa Vujosevic, Goran Popivoda:
Unicyclic graphs with extremal values of arithmetic-geometric index. 67-75
- Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi, Pouyeh Sharifani:
Characterizing extremal graphs for open neighbourhood location-domination. 76-79
- Soogang Eoh, Suh-Ryung Kim:
On chordal phylogeny graphs. 80-91 - Wei Yang, Baoyindureng Wu:
Proof of a conjecture on the strong chromatic index of Halin graphs. 92-102 - Katharina T. Huber, Vincent Moulton, Andreas Spillner:
Optimal realizations and the block decomposition of a finite metric space. 103-113 - Dániel Garamvölgyi:
On the global rigidity of tensegrity graphs. 114-122 - Yisheng Jiang, Mei Lu:
A note on the minimum inverse sum indeg index of cacti. 123-128 - Ali Dehghan:
On the in-out-proper orientations of graphs. 129-138
- Jothi Rangasamy:
On "Practical and secure outsourcing algorithms for solving quadratic congruences in IoTs" from IEEE IoT journal. 139-146
- Sabyasachi Dey, Santanu Sarkar:
A theoretical investigation on the distinguishers of Salsa and ChaCha. 147-162 - Jian-Bo Lv, Jianxi Li, Nian Hong Zhou:
List injective edge-coloring of subcubic graphs. 163-170
- Toufik Mansour, Reza Rastegar:
Fixed points of a random restricted growth sequence. 171-177
- Chol-Un Kim, Kwang-Il Sol:
Degenerate drawing of outerplanar graphs with two edge lengths. 178-188 - Suyun Jiang, Hao Li, Jin Yan:
Vertex-disjoint stars in K1, r-free graphs. 189-197 - Tomohiro Koana, André Nichterlein:
Detecting and enumerating small induced subgraphs in c-closed graphs. 198-207
- Mikhail Moshkov:
Decision trees based on 1-consequences. 208-214 - José Luis Palacios, Greg Markowsky:
Kemeny's constant and Kirchhoffian indices for conjoined highly symmetric graphs. 215-220
- Bing-Hau He, Henryk A. Witek:
Enumeration of Clar covers of parallelogram chains. 221-233 - Jan Pavlík:
Representation of graphs by means of generalized metrics. 234-247 - Aleksandar Ilic, Modjtaba Ghorbani, Seyran Azizi, Matthias Dehmer:
On conjectures of network distance measures by using graph spectra. 248-255
- Francisco J. Soulignac:
Total 2-domination of proper interval graphs. 256-262
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-02-21 19:35 CET 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:
