default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 359
Volume 359, 2024
- Brian Alspach
, Aditya Joshi:
On the 2-spanning cyclability of honeycomb toroidal graphs. 1-9 - Jun Ge, Yucui Liao, Bohan Zhang:
Resistance distances and the Moon-type formula of a vertex-weighted complete split graph. 10-15 - Maidoun Mortada:
About S-packing coloring of 3-irregular subcubic graphs. 16-18 - Mengmeng Liu, Qianqian Zhen:
The weighted Mostar index of cacti. 19-33 - Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
The proper 2-connection number of several graph classes. 34-44 - Nili Guttmann-Beck, Refael Hassin, Michal Stern:
On partitioning minimum spanning trees. 45-54 - 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. 55-74 - Tianyi Bu, Shaobin Huang:
Spectra of total graphs. 75-82 - Humaira Hameed:
On semi-transitivity of (extended) Mycielski graphs. 83-88 - Linda Knüver, Mareike Fischer, Marc Hellmuth, Kristina Wicke:
The weighted total cophenetic index: A novel balance index for phylogenetic networks. 89-142 - Phillippe Samer, Phablo F. S. Moura:
Polyhedral approach to weighted connected matchings in general graphs. 143-152 - Hongxia Liu, Xiaogang Pan:
Independence number and minimum degree for path-factor critical uniform graphs. 153-158 - Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl:
Finding k-community structures in special graph classes. 159-175 - Narda Cordero-Michel, Hortensia Galeana-Sánchez:
A quick way to verify if a graph is 3-colorable. 176-185 - Aseem Dalal, Bhawani Sankar Panda, C. A. Rodger:
Total colorings of complete multipartite graphs using amalgamations. 186-195 - Mahin Bahrami, Dariush Kiani, Asghar Bahmani:
Dot product dimension of unicyclic graphs. 196-213 - Taijiang Jiang, Hongyan Cai, Qiang Sun, Chao Zhang:
A note on Hamilton ℓ-cycle decomposition of complete k-partite hypergraphs. 214-219 - Lei Zhao, Zhao Zhang:
Algorithm for partial sweep coverage on a line. 220-228 - Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational complexity of covering disconnected multigraphs. 229-243 - Mingxu Guo, Haiyan Chen:
The matching polynomial of the path-tree of a complete graph. 244-249 - Jonas Costa Ferreira da Silva, Frédéric Havet:
On b-greedy colourings and z-colourings. 250-268 - Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel:
Packing coloring of hypercubes with extended Hamming codes. 269-277 - Kaustav Paul, Ankit Sharma, Arti Pandey:
Algorithmic results for weak Roman domination problem in graphs. 278-289 - Boris Brimkov, Randy Davila, Houston Schuerger, Michael Young:
On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs. 290-302 - Jinfeng Liu, Fei Huang:
Matchings in bipartite graphs with a given number of cuts. 303-309 - Sergey Kitaev, Dun Qiu:
On a family of universal cycles for multi-dimensional permutations. 310-320 - Mengya He, Huixian Li, Ning Song, Shengjin Ji:
The zero forcing number of claw-free cubic graphs. 321-330 - Yue Yan, Lan Lei, Yang Wu, Hong-Jian Lai:
Squares of graphs are optimally (s,t)-supereulerian. 331-342 - Harshil Mittal, Saraswati Nanoti, Aditi Sethia:
Diverse fair allocations: Complexity and algorithms. 343-353
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 2024-09-14 23:51 CEST 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:
