![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Discrete Applied Mathematics, Volume 313
Volume 313, May 2022
- José Neto
:
A polyhedral view to a generalization of multiple domination. 1-17 - Yoshiaki Doi, Norio Konno, Tomoki Nakamigawa, Tadashi Sakuma
, Etsuo Segawa
, Hidehiro Shinohara, Shunya Tamura, Yuuho Tanaka, Kosuke Toyota:
On the average hitting times of the squares of cycles. 18-28 - Xiaohan Cheng, Bin Wang, Jihui Wang:
The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11. 29-39 - Jason I. Brown
:
Maximal intervals of decrease and inflection points for node reliability. 40-44 - Jessica Ferraro, Genevieve A. Newkirk, Songling Shan
:
Antimagic orientation of subdivided caterpillars. 45-52 - Kelin Luo
, Thomas Erlebach, Yinfeng Xu:
Car-sharing between two locations: Online scheduling with flexible advance bookings. 53-66 - Zhengrong Lu, Lingsheng Shi:
A sufficient condition for edge 6-colorable planar graphs with maximum degree 6. 67-70 - Jaroslaw Grytczuk
, Stanislav Jendrol'
, Mariusz Zajac
:
Graph polynomials and paintability of plane graphs. 71-79 - Wayne Goddard, Michael A. Henning:
Domination and dominator colorings in planar graphs with small diameter. 80-92 - Qi Zhou, Dein Wong, Fenglei Tian:
Relation between the nullity of a graph and its matching number. 93-98 - Matthew Bold
, Marc Goerigk
:
Investigating the recoverable robust single machine scheduling problem under interval uncertainty. 99-114 - Shuchao Li, Yangyang Xu, Huihui Zhang:
Some further results on the maximal hitting times of trees with some given parameters. 115-134 - Fei-Huang Chang, Ma-Lian Chia, David Kuo, Wen Deng, Sheng-Chyang Liaw, Zhishi Pan:
Transferable domination number of graphs. 135-146 - Christophe Crespelle, Petr A. Golovach
:
Cyclability in graph classes. 147-178
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.