Discret. Appl. Math.

Keyphrases

Publications

volume 359, 2024

Yue Yan, Lan Lei, Yang Wu, Hong-Jian Lai
Squares of graphs are optimally (s,t)-supereulerian. Discret. Appl. Math. 359 (2024)
Tianyi Bu, Shaobin Huang
Spectra of total graphs. Discret. Appl. Math. 359 (2024)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. Discret. Appl. Math. 359 (2024)
Hongxia Liu, Xiaogang Pan
Independence number and minimum degree for path-factor critical uniform graphs. Discret. Appl. Math. 359 (2024)
Mengmeng Liu, Qianqian Zhen
The weighted Mostar index of cacti. Discret. Appl. Math. 359 (2024)
Mahin Bahrami, Dariush Kiani, Asghar Bahmani
Dot product dimension of unicyclic graphs. Discret. Appl. Math. 359 (2024)
Aseem Dalal, Bhawani Sankar Panda, C. A. Rodger
Total colorings of complete multipartite graphs using amalgamations. Discret. Appl. Math. 359 (2024)
Jonas Costa Ferreira da Silva, Frédéric Havet
On b-greedy colourings and z-colourings. Discret. Appl. Math. 359 (2024)
Harshil Mittal, Saraswati Nanoti, Aditi Sethia
Diverse fair allocations: Complexity and algorithms. Discret. Appl. Math. 359 (2024)
Phillippe Samer, Phablo F. S. Moura
Polyhedral approach to weighted connected matchings in general graphs. Discret. Appl. Math. 359 (2024)
Brian Alspach, Aditya Joshi
On the 2-spanning cyclability of honeycomb toroidal graphs. Discret. Appl. Math. 359 (2024)
Linda Knüver, Mareike Fischer, Marc Hellmuth, Kristina Wicke
The weighted total cophenetic index: A novel balance index for phylogenetic networks. Discret. Appl. Math. 359 (2024)
Lei Zhao, Zhao Zhang
Algorithm for partial sweep coverage on a line. Discret. Appl. Math. 359 (2024)
Taijiang Jiang, Hongyan Cai, Qiang Sun, Chao Zhang
A note on Hamilton ℓ-cycle decomposition of complete k-partite hypergraphs. Discret. Appl. Math. 359 (2024)
Narda Cordero-Michel, Hortensia Galeana-Sánchez
A quick way to verify if a graph is 3-colorable. Discret. Appl. Math. 359 (2024)
Jinfeng Liu, Fei Huang
Matchings in bipartite graphs with a given number of cuts. Discret. Appl. Math. 359 (2024)
Maidoun Mortada
About S-packing coloring of 3-irregular subcubic graphs. Discret. Appl. Math. 359 (2024)
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
The proper 2-connection number of several graph classes. Discret. Appl. Math. 359 (2024)
Sergey Kitaev, Dun Qiu
On a family of universal cycles for multi-dimensional permutations. Discret. Appl. Math. 359 (2024)
Kaustav Paul, Ankit Sharma, Arti Pandey
Algorithmic results for weak Roman domination problem in graphs. Discret. Appl. Math. 359 (2024)
Humaira Hameed
On semi-transitivity of (extended) Mycielski graphs. Discret. Appl. Math. 359 (2024)
Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová
Computational complexity of covering disconnected multigraphs. Discret. Appl. Math. 359 (2024)
Mengya He, Huixian Li, Ning Song, Shengjin Ji
The zero forcing number of claw-free cubic graphs. Discret. Appl. Math. 359 (2024)
Boris Brimkov, Randy Davila, Houston Schuerger, Michael Young
On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs. Discret. Appl. Math. 359 (2024)
Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl
Finding k-community structures in special graph classes. Discret. Appl. Math. 359 (2024)
Mingxu Guo, Haiyan Chen
The matching polynomial of the path-tree of a complete graph. Discret. Appl. Math. 359 (2024)
Nili Guttmann-Beck, Refael Hassin, Michal Stern
On partitioning minimum spanning trees. Discret. Appl. Math. 359 (2024)
Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel
Packing coloring of hypercubes with extended Hamming codes. Discret. Appl. Math. 359 (2024)
Jun Ge, Yucui Liao, Bohan Zhang
Resistance distances and the Moon-type formula of a vertex-weighted complete split graph. Discret. Appl. Math. 359 (2024)

volume 358, 2024