![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Discrete Applied Mathematics, Volume 339
Volume 339, November 2023
- Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant delay lattice train schedules. 1-10
- Jiadong Wu, Yisai Xue, Liying Kang
:
Some sufficient conditions for graphs being k-leaf-connected. 11-20 - Pasin Manurangsi, Warut Suksompong:
Fixing knockout tournaments with seeds. 21-35 - Antti Kuusisto, Raine Rönnholm:
The optimal way to play the most difficult repeated two-player coordination games. 36-52
- Flavia Bonomo-Braberman
, Gastón Abel Brito:
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs. 53-77
- Nathan Kahl, Kristi Luttrell:
On maximum graphs in Tutte polynomial posets. 78-88
- Chen Guo
, Chengzhong Wu, Zhifang Xiao, Jianbo Lu
, Zhihong Liu:
The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model. 89-106
- Marcelo Bianchetti
, Javier Marenco:
A branch-and-cut algorithm for the routing and spectrum allocation problem. 107-126
- Abel Cabrera Martínez, Alejandro Estrada-Moreno
:
Double domination in rooted product graphs. 127-135 - Borut Luzar
, Mária Maceková, Simona Rindosová, Roman Soták, Katarína Sroková, Kenny Storgel:
Locally irregular edge-coloring of subcubic graphs. 136-148
- Biao Wu
:
A refined result on cross-intersecting families. 149-153
- Peter Borg
:
Isolation of connected graphs. 154-165 - Atli Fannar Franklín, Robert K. Moniot:
The difficulty of beating the Taxman. 166-171
- Yuxing Yang
, Xiaohui Hua, Lulu Yang:
Hyper K1,r and sub-K1,r fault tolerance of star graphs. 172-177
- Mohsen Jannesari:
Graphs with doubly resolving number 2. 178-183 - Yu Yang, Bang-Bang Jin, Mei Lu, Zhihao Hui
, Lu-Xuan Zhao, Hua Wang:
Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices. 184-201 - Josep Fàbrega
, Jaume Martí-Farré, Xavier Muñoz:
Immune sets in monotone infection rules. Characterization and complexity. 202-215 - Jonathan Joe, Matt Noble:
A Triangle-free, 4-chromatic Q3 Euclidean distance graph Scavenger hunt! 216-226 - Kaiyang Lan, Feng Liu, Yidong Zhou:
Some remarks on graphs with no induced subdivision of K4. 227-233 - Natawat Klamsakul, Pantaree Thengarnanchai, Mattanaporn Suebtangjai, Pailin Kaewperm, Nuttanon Songsuwan, Pawaton Kaemawichanurat:
Counting maximal independent sets in some n-gonal cacti. 234-280 - Jiayu Lou, Ligong Wang
, Ming Yuan:
On the α-index of minimally 2-connected graphs with given order or size. 281-291 - Qihui Jin, Shasha Li
, Mengmeng Xie:
3-path-connectivity of Cayley graphs generated by transposition trees. 292-299 - Jan Pavlík
:
Distributivity of a segmentation lattice. 300-316
- Celso A. Weffort-Santos
, Rafael C. S. Schouery:
Graphs without gap-vertex-labellings: Families and bounds. 317-335
- Fumihiko Nakano
, Taizo Sadahiro, Tetsuya Sakurai:
Top to random shuffles on colored permutations. 336-348 - Kyle Murphy:
Strict optimal rubbling of graphs. 349-361
![](https://dblp.org/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.