default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 304
Volume 304, December 2021
- Chunfang Li
, Shangwei Lin:
The 1-good neighbor connectivity of unidirectional star graph networks. 1-11 - Michael A. Henning, Anders Yeo:
Lower bounds on Tuza constants for transversals in linear uniform hypergraphs. 12-22 - Vladimir Bozovic, Zana Kovijanic Vukicevic, Goran Popivoda, Rong-Ying Pan, Xiao-Dong Zhang:
Extreme Wiener indices of trees with given number of vertices of maximum degree. 23-31 - Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Parameterized algorithms for the Happy Set problem. 32-44 - Rubing Chen, Jinjiang Yuan:
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines. 45-54 - Máté Gyarmati, Péter Ligeti:
On the information ratio of graphs without high-degree neighbors. 55-62 - Jiajian Li, Weizhong Wang:
The (degree-) Kirchhoff indices in random polygonal chains. 63-75
- Yuping Gao, Songling Shan:
Nonempty intersection of longest paths in graphs without forbidden pairs. 76-83
- Patrick Bennett, Ryan Cushman, Andrzej Dudek:
On the number of alternating paths in random graphs. 84-97 - Kristina Ago, Bojan Basic:
On highly palindromic words: The n-ary case. 98-109 - Qinghong Zhao, Bing Wei:
Gallai-Ramsey numbers for graphs with chromatic number three. 110-118 - Marko Jakovac, Yota Otachi:
On the security number of the Cartesian product of graphs. 119-128
- Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek:
A note on connected greedy edge colouring. 129-136
- Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng, Erling Wei:
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions. 137-152 - Sergio Bermudo, Magda Dettlaff, Magdalena Lemanska:
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number. 153-163 - Vladimir Braverman, Harry Lang, Keith D. Levin, Yevgeniy Rudoy:
Metric k-median clustering in insertion-only streams. 164-180 - Xingfu Li, Guihai Yu, Sandi Klavzar:
On the average Steiner 3-eccentricity of trees. 181-195 - Richard A. Brualdi, Lei Cao:
Pattern-avoiding (0, 1)-matrices and bases of permutation matrices. 196-211
- André Casajus:
Second-order productivity, second-order payoffs, and the Shapley value. 212-219
- Satoshi Nakamura, Masaya Yasuda:
Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation. 220-229
- Abdu Alameri, Mohammed A. Al-Sharafi, Esmail Ali, Mohammed S. Gumaan:
A note on Topological indices and coindices of disjunction and symmetric difference of graphs. 230-235
- Xiangwen Li, Runrun Liu, Gexin Yu:
Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable. 236-247 - Inbar Daum-Sadon, Gabriel Nivasch:
Upper bounds for stabbing simplices by a line. 248-259 - Guillaume Bagan, Valentin Gledel, Marc Heinrich, Fionn Mc Inerney:
Weighted total acquisition. 260-282 - Kexiang Xu, Jie Li, Hua Wang:
The number of subtrees in graphs with given number of cut edges. 283-296 - Pantelimon Stanica:
Investigations on c-boomerang uniformity and perfect nonlinearity. 297-314 - Yuke Zhang, Huiqiu Lin:
Perfect matching and distance spectral radius in graphs and bipartite graphs. 315-322
- Sihong Su:
Corrigendum to "The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions" [Discrete Appl. Math. 297 (2021) 60-70]. 323
- Abdollah Khodkar, Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero:
Covering Italian domination in graphs. 324-331 - Moussa Daamouch:
Seymour's second neighborhood conjecture for m-free, k-transitive, k-anti-transitive digraphs and some approaches. 332-341
- Fernanda Couto, Luís Felipe I. Cunha:
Hardness and efficiency on t-admissibility for graph operations. 342-348 - Barnabás Janzer:
A note on the orientation covering number. 349-351
- Marco Antonio López-Ortiz, Rocío Sánchez-López:
Restricted domination in Quasi-transitive and 3-Quasi-transitive digraphs. 352-364 - Gang Zhang, Baoyindureng Wu:
K1, 2-isolation in graphs. 365-374 - Anna Lladó, Hamid Mokhtar, Oriol Serra, Sanming Zhou:
Distance-constrained labellings of Cartesian products of graphs. 375-383 - Abhishek Kesarwani, Sumit Kumar Pandey, Santanu Sarkar, Ayineedi Venkateswarlu:
Recursive MDS matrices over finite commutative rings. 384-396
- Annachiara Korchmaros:
The structure of 2-colored best match graphs. 397-416
- Juan Liu, Omaema Lasfar, Jia Wei, Xindong Zhang, Hong-Jian Lai:
Matching and spanning trails in digraphs. 417-431 - Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka:
An improvement to Chvátal and Thomassen's upper bound for oriented diameter. 432-440
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-20 19:43 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:
