Discrete Applied Mathematics, Volume 340

Volume 340, December 2023

Contribution

• 
  Ji-Hwan Jung, Suh-Ryung Kim, Hyesun Yoon:
  On the limit of the sequence {Cm(D)}m=1∞ for a multipartite tournament D. 1-13
• 
  Weizhen Chen, Meng Ji, Yaping Mao, Meiqin Wei:
  Complete bipartite graphs without small rainbow stars. 14-20
• 
  Qian-Qian Chen, Ji-Ming Guo:
  Nordhaus-Gaddum type inequality for the integer k-matching number of a graph. 21-31
• 
  Zoran Stanic:
  Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph. 32-40
• 
  Zuwen Luo, Kexiang Xu:
  Extremal problems for connected set enumeration. 41-52

Game Theory

• 
  Vladimir Gurvich, Mariya Naumova:
  Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles. 53-68

Note

• 
  Leilei Zhang:
  The minimum Kirchhoff index of phenylene chains. 69-75
• 
  Xiaodong Chen, Qinghai Liu, Xiwu Yang:
  Two completely independent spanning trees of split graphs. 76-78
• 
  John Haslegrave:
  Monitoring edge-geodetic sets: Hardness and graph products. 79-84

Contribution

• 
  Yinsong Chen, Vladislav Kargin:
  The number of ribbon tilings for strips. 85-103
• 
  Lu Miao, Ruifang Liu, Jie Xue:
  Maxima of the Q-index of non-bipartite graphs: Forbidden short odd cycles. 104-114
• 
  Ryoga Mahara:
  Existence of EFX for two additive valuations. 115-122

Special Issue Paper: LAGOS'21 - Latin and American Algorithms, Graphs, and Optimization Symposium

• 
  Luérbio Faria, Mauro Nigro, Myriam Preissmann, Diana Sasaki:
  Results about the total chromatic number and the conformability of some families of circulant graphs. 123-133

Contribution

• 
  Sonja Kraiczy, Ágnes Cseh, David F. Manlove:
  On weakly and strongly popular rankings. 134-152
• 
  Hung P. Hoang, Stefan Lendl, Lasse Wulf:
  Assistance and interdiction problems on interval graphs. 153-170

Special Issue Paper: Algorithms and Discrete Applied Mathematics (CALDAM 2021)

• 
  Archak Das, Kaustav Bose, Buddhadeb Sau:
  Memory optimal dispersion by anonymous mobile robots. 171-182

Contribution

• 
  Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
  Extension of some edge graph problems: Standard, parameterized and approximation complexity. 183-201
• 
  Dominique Perrin, Christophe Reutenauer:
  The palindromization map. 202-214
• 
  Fabrizio Colombo, Rolf Sören Kraußhar, Irene Sabadini, Y. Simsek:
  On the generating functions and special functions associated with superoscillations. 215-227

Special Issue Paper: LAGOS'21 - Latin and American Algorithms, Graphs, and Optimization Symposium

• 
  Luis Gustavo da Soledade Gonzaga, Jadder Bismarck de Sousa Cruz, Sheila Morais de Almeida, Cândida Nunes da Silva:
  The Overfull Conjecture on split-comparability and split-interval graphs. 228-238

Contribution

• 
  Pavel Chebotarev, David Peleg:
  The power of small coalitions under two-tier majority on regular graphs. 239-258
• 
  Gregory Z. Gutin, Anders Yeo:
  (1,1)-Cluster Editing is polynomial-time solvable. 259-271

Special Issue Paper: LAGOS'21 - Latin and American Algorithms, Graphs, and Optimization Symposium

• 
  Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado:
  On the complexity of the Cable-Trench Problem. 272-285

Contribution

• 
  Kexiang Xu, Jing Tian, Sandi Klavzar:
  New transmission irregular chemical graphs. 286-295
• 
  C. A. Weffort-Santos, C. N. Campos, Rafael C. S. Schouery:
  On gap-labellings of some families of graphs. 296-314
• 
  Aida Abiad, Leonardo Silva de Lima, Sina Kalantarzadeh, Mona Mohammadi, Carla Silva Oliveira:
  Bounding the sum of the largest signless Laplacian eigenvalues of a graph. 315-326

Communications

• 
  Edmond W. H. Lee:
  Embedding finite involution semigroups in matrices with transposition. 327-330

Contribution

• 
  Jie Chen, Shou-Jun Xu:
  P5-isolation in graphs. 331-349
• 
  Hongzhang Chen, Jianxi Li, Peng Huang:
  On the Aα-spectral radius of graphs with given size. 350-362