default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 345
Volume 345, March 2024
- Norbert Hegyvári:
On arithmetic sums of Cantor-type sequences of integers. 1-3 - Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos:
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. 4-8
- Yuehua Bu, Peng Wang, Hongguo Zhu, Junlei Zhu:
Injective chromatic index of sparse graphs. 9-16 - Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz
:
Weighted microscopic image reconstruction. 17-33
- Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor:
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes. 34-51
- Nasrin Dehgardi, Tomislav Doslic:
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number. 52-61 - Fawad Ali, Bilal A. Rather, Muhammad Naeem, Wei Wang:
Degree and distance based topological descriptors of power graphs of finite non-abelian groups. 62-76 - M. A. Shalu, Cyriac Antony:
Hardness transitions and uniqueness of acyclic colouring. 77-98 - Sergio Bermudo, Roslan Hasni, Fateme Movahedi, Juan Eduardo Nápoles Valdés:
The Geometric-Arithmetic index of trees with a given total domination number. 99-113 - Cintia Izabel Cararo, Sheila Morais de Almeida, Cândida Nunes da Silva:
Further split graphs known to be Class 1 and a characterization of subgraph-overfull split graphs. 114-124
- Zemin Jin, Rui Yu, Yuefang Sun:
Anti-Ramsey number of matchings in outerplanar graphs. 125-135 - Zitao Zou, Lingping Zhong:
A lower bound on the modified Randić index of line graphs. 136-140
- Shanshan Guo, Fei Huang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs. 141-146 - Peter Borg, Carl Feghali, Rémi Pellerin:
Solution to a problem of Katona on counting cliques of weighted graphs. 147-155 - Tao Wang, Xiaojing Yang:
On odd colorings of sparse graphs. 156-169 - Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai:
s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. 170-189 - Yuan Zhang, Haiying Wang, Guifu Su, Kinkar Chandra Das:
Extremal problems on the Atom-bond sum-connectivity indices of trees with given matching number or domination number. 190-206 - Xiaojun Zhao, Qingying Deng, Zhiyi Wang:
Restricted arc-connectivity of unidirectional star graphs. 207-214
- S. N. Popova:
Bounded quantifier depth spectrum for random uniform hypergraphs. 215-225
- Joan M. Morris:
Slow coloring of 3k-connected graphs. 226-230
- Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat:
Cops and Robber on butterflies, grids, and AT-free graphs. 231-245
- Xiaxia Guan, Xian'an Jin, Tianlong Ma:
The interior and exterior polynomials are well-defined. 246-253
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 2026-03-29 22:35 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:
