default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 338
Volume 338, October 2023
- Juan Liu, Xiaoxue Hu
, Dongdong Zhang, Jiangxu Kong:
The linear 2-arboricity of IC-planar graphs. 1-7
- Andrew Bloch-Hansen, Nasim Samei, Roberto Solis-Oba:
A local search approximation algorithm for the multiway cut problem. 8-21
- Raquel S. F. Bravo, Rodolfo A. Oliveira, Fábio da Silva, Uéverton S. Souza:
Partitioning P4-tidy graphs into a stable set and a forest. 22-29
- Manuela Blaum, Javier Marenco:
Complete characterizations of the 2-domination and P3-hull number polytopes. 30-45
- Sandi Klavzar, Hui Lei, Xiaopan Lian, Yongtang Shi:
A characterization of 4-χS-vertex-critical graphs for packing sequences with s1=1 and s2≥3. 46-55 - Michael Yatauro:
Wiener index and vulnerability parameters of graphs. 56-68
- Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Approximation algorithms for orthogonal line centers. 69-76 - Vikash Tripathi, Arti Pandey, Anil Maheshwari:
A linear-time algorithm for semitotal domination in strongly chordal graphs. 77-88
- Abbas Khaleghi, Manouchehr Zaker:
More results on the z-chromatic number of graphs. 89-99 - Yu Luan, Mei Lu, Yi Zhang:
Fractional matching preclusion numbers of Cartesian product graphs. 100-112 - Silvia Lorenzo-Freire, Adrián González-Maestro, José María Alonso-Meijide:
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups. 113-124 - Stefan Steinerberger:
The boundary of a graph and its isoperimetric inequality. 125-134 - Yilun Shang:
Characterization of expansion-related properties of modular graphs. 135-144 - Anthony Bonato, Ryan Cushman, Trent G. Marbach, Brittany Pittman:
The localization game on oriented graphs. 145-157 - Aaron Slobodin, Gary MacGillivray, Wendy J. Myrvold:
2-limited broadcast domination on grid graphs. 158-178 - Wenwen Sun, Haiyan Chen, Mingying Hu:
On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs. 179-186
- Fanggang Xue, Jin-Hui Fang, Jie Ma:
On exponential type sequences. 187-189
- Enrique Gerstl, Gur Mosheiov:
The LPT heuristic for minimizing total load on a proportionate openshop. 190-198 - Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau:
Target set selection with maximum activation time. 199-217 - Jia-Bao Liu, Ya-Qian Zheng, Xin-Bei Peng:
The statistical analysis for Sombor indices in a random polygonal chain networks. 218-233 - Myungho Choi, Suh-Ryung Kim:
Digraphs whose m-step competition graphs are trees. 234-246
- Jiangyue Zhang, Yan Wu, Heping Zhang:
The maximum matching extendability and factor-criticality of 1-planar graphs. 247-254
- Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum consistent subset of simple graph classes. 255-277
- Maurizio Damiani:
Partially unate Boolean functions: Properties of their sum-of-products representations. 278-292
- Fatemeh Sadat Mousavi, Masoumeh Nouri:
Strong incidence coloring of outerplanar graphs. 293-301 - Reza Naserasr, Weiqiang Yu:
Separating signatures in signed planar graphs. 302-310 - Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski:
Edge coloring of graphs of signed class 1 and 2. 311-319 - Hui Zhang, Rong-Xia Hao, Hong-Jian Lai, Jaeun Lee:
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs. 320-328 - Ian G. Ludden, Douglas M. King, Sheldon H. Jacobson:
3D geo-graphs: Efficient flip verification for the spherical zoning problem. 329-346
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 2026-07-15 00:52 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
