default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 288
Volume 288, January 2021
- Pengyu Liu
:
A tree distinguishing polynomial. 1-8 - Valentin Bouquet, François Delbot, Christophe Picouleau:
On the vertices belonging to all, some, none minimum dominating set. 9-19 - Theresa Baren, Michael Cory, Mia Friedberg, Peter Gardner, James M. Hammer, Joshua Harrington, Daniel McGinnis, Riley Waechter, Tony W. H. Wong:
On the domination number of permutation graphs and an application to strong fixed points. 20-34 - Muhuo Liu, Ioan Tomescu, Jianping Liu:
Unified extremal results for k-apex unicyclic graphs (trees). 35-49 - Micheal Arockiaraj, Jia-Bao Liu, J. Nancy Delaila, Arul Jeya Shalini:
On the optimal layout of balanced complete multipartite graphs into grids and tree related structures. 50-65
- André Casajus:
Extension operators for TU games and the Lovász extension. 66-73
- Joshua Harrington, Kedar Karhadkar, Madeline Kohutka, Tessa Stevens, Tony W. H. Wong:
Two dependent probabilistic chip-collecting games. 74-86
- Ruijuan Gu, Seog-Jin Kim, Yulai Ma, Yongtang Shi:
On list 3-dynamic coloring of near-triangulations. 87-90
- Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano, Tsuyoshi Yagita:
How to pack directed acyclic graphs into small blocks. 91-113 - Dávid Mezofi, Gábor Péter Nagy:
New Steiner 2-designs from old ones by paramodifications. 114-122 - Yibo Gao, Rupert Li:
Compatible recurrent identities of the sandpile group and maximal stable configurations. 123-137 - Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and enhanced inclusion-minimal cograph completion. 138-151 - Nicola Bianchessi, Stefan Irnich, Christian Tilk:
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. 152-170 - Ping Li, Xueliang Li:
Monochromatic disconnection of graphs. 171-179 - Qiqi Xiao, Mingyao Zeng, Zikai Tang, Hongbo Hua, Hanyuan Deng:
The hexagonal chains with the first three maximal Mostar indices. 180-191 - Xiaojing Yang, Junfeng Du, Liming Xiong:
Forbidden subgraphs for supereulerian and hamiltonian graphs. 192-200 - Sylwia Cichacz, Tomasz Hinc:
A magic rectangle set on Abelian groups and its application. 201-210 - Kinkar Chandra Das, Suresh Elumalai, Arpita Ghosh, Toufik Mansour:
On conjecture of Merrifield-Simmons index. 211-217 - Katrin Heßler, Stefan Irnich:
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem. 218-234 - Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Adaptive majority problems for restricted query graphs and for weighted sets. 235-245
- Ivan Martino:
Cooperative games on simplicial complexes. 246-256
- Xuenan Chang, Jicheng Ma, Da-Wei Yang:
Symmetric property and reliability of locally twisted cubes. 257-269 - Pengda Liu:
On card guessing game with one time riffle shuffle and complete feedback. 270-278
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-01-24 17:05 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:
