Discrete Applied Mathematics, Volume 342

Volume 342, January 2024

Special Issue Paper: Special Issue for WEPA 2020: Enumeration Problems and Applications

• 
  Katsuhisa Yamanaka, Shin-Ichi Nakano:
  Enumerating floorplans with walls. 1-11

Contribution

• 
  Rong Chen, Kaiyang Lan, Yidong Zhou:
  Coloring {P2∪P3,house}-free graphs with Δ-1 colors. 12-18
• 
  Guixin Deng, Jin Geng, Xiangneng Zeng:
  Group distance magic labeling of tetravalent circulant graphs. 19-26

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

• 
  David Hartman, Aneta Pokorná, Pavel Valtr:
  On the connectivity and the diameter of betweenness-uniform graphs. 27-37

Contribution

• 
  Patrice Bertrand, Jean Diatta:
  An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering. 38-63

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

• 
  Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Çaskurlu:
  Priority-based bin packing with subset constraints. 64-75

Contribution

• 
  Zhiyong Gan, Yanping Xu:
  On defect restricted matching extension graphs. 76-81
• 
  Daniel W. Cranston:
  Odd-sum colorings of planar graphs. 82-88

Special Issue Paper: Special Issue for WEPA 2020: Enumeration Problems and Applications

• 
  Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid:
  Shortest distances as enumeration problem. 89-103

Contribution

• 
  Yayang Liu, Xiaolin Chen:
  The change of Seidel energy of 5-partite Turán graph due to edge deletion. 104-123
• 
  Peter Frankl, Erica L. L. Liu, Jian Wang, Zhe Yang:
  Non-trivial t-intersecting separated families. 124-137

Note

• 
  Yuzhenni Wang, Xiao-Dong Zhang:
  A note on median eigenvalues of subcubic graphs. 138-141

Contribution

• 
  Jing Huang, Huihui Zhang:
  Extremal vertex-degree function index with given order and dissociation number. 142-152
• 
  Chenxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng:
  On the distance-edge-monitoring numbers of graphs. 153-167

Note

• 
  Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro:
  Disjointness graphs of segments in R2 are almost all hamiltonian. 168-173

Contribution

• 
  Mengyu Cao, Ke Liu, Mei Lu, Zequn Lv:
  Treewidth of the q-Kneser graphs. 174-180

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

• 
  I. Vinod Reddy:
  On structural parameterizations of load coloring. 181-189

Special Issue Paper: Special Issue for WEPA 2020: Enumeration Problems and Applications

• 
  Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara:
  Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs. 190-199

Special Issue Paper: String Algorithms

• 
  Sergio De Agostino:
  Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing. 200-206

Special Issue Paper: Combinatorial Optimization ISCO 2022

• 
  Gruia Calinescu, Hemanshu Kaul, Bahareh Kudarzi:
  An improved algorithm for finding maximum outerplanar subgraphs. 207-217

Contribution

• 
  Qi Ma:
  Extremal polygonal chains with respect to the Kirchhoff index. 218-226

Note

• 
  Hongyang Wang:
  On the chromatic number of graphs of odd girth without longer odd holes. 227-230

Contribution

• 
  Ashok Kumar Das, Rajkamal Sahu:
  A characterization of unit interval bigraphs of open and closed intervals. 231-243
• 
  Meijie Ma, Xiang-Jun Li, Guijuan Wang, Yongli Zan:
  Generalized fault-tolerance for enhanced hypercubes. 244-252
• 
  Magda Dettlaff, Michael A. Henning, Jerzy Topp:
  Common domination perfect graphs. 253-259

Note

• 
  Ping Li:
  Planar Turán number of the disjoint union of cycles. 260-274

Contribution

• 
  Zhen Ji, Ralf Klasing, Wen Li, Yaping Mao, Xiaoyan Zhang:
  Erdös-Gallai-type problems for distance-edge-monitoring numbers. 275-285
• 
  Aiyun Ye, Shu-Guang Guo, Rong Zhang:
  Some extremal problems on Aα-spectral radius of graphs with given size. 286-294
• 
  Gek Ling Chia, Kai An Sim:
  On the skewness of products of graphs. 295-303
• 
  Devsi Bantva, Daphne Der-Fen Liu:
  Radio number for the Cartesian product of two trees. 304-316
• 
  Milan Basic:
  Minimal spread of integral circulant graphs. 317-333

Special Issue Paper: Combinatorial Optimization ISCO 2020

• 
  Uttam K. Gupta, Dinabandhu Pradhan:
  Strengthening Brooks' chromatic bound on P6-free graphs. 334-346

Contribution

• 
  Wipawee Tangjai, Kittikorn Nakprasit, Keaitsuda Maneeruk Nakprasit, Pongpat Sittitrai:
  Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition. 347-354
• 
  Shi-Mei Ma, Hao Qi, Jean Yeh, Yeong-Nan Yeh:
  Commuting Eulerian operators. 355-361
• 
  Imran Allie, Edita Mácajová, Martin Skoviera:
  Flow resistance to resistance ratios in cubic graphs. 362-367
• 
  Jing Huang, Xianya Geng, Shuchao Li, Zihan Zhou:
  On spectral extrema of graphs with given order and dissociation number. 368-380
• 
  Mouhamad El Joubbeh, Salman Ghazal:
  Existence of paths with t blocks in k(t)-chromatic digraph. 381-384

Note

• 
  Akbar Ali, Stefan Stankov, Emina I. Milovanovic, Marjan M. Matejic, Igor Z. Milovanovic:
  Bounds on the modified second Zagreb index. 385-390

Contribution

• 
  Yang Xiao, Mingfang Huang:
  A weak DP-coloring of planar graphs without 4- and 9-cycles. 391-397