default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 337
Volume 337, October 2023
- Renzo Gómez
, Juan Gutiérrez:
Path eccentricity of graphs. 1-13 - Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau:
Locating-dominating sets in local tournaments. 14-24 - Walter Carballosa, Justin Wisby:
Total k-domination in Cartesian product of complete graphs. 25-41
- Chunhui Lai:
An old problem of Erdős: A graph without two cycles of the same length. 42-45
- R. Balakrishnan, S. Krishnamoorthy, Wasin So:
Resistance distance in connected balanced digraphs. 46-53 - Shuang Zhao:
Matching anti-forcing polynomials of catacondensed hexagonal systems. 54-67 - Luke C. Brown, William J. Martin, Duncan Wright:
Continuous time quantum walks on graphs: Group state transfer. 68-80 - Kristin Sheridan, Joseph Berleant, Mark Bathe, Anne Condon, Virginia Vassilevska Williams:
Factorization and pseudofactorization of weighted graphs. 81-105 - Natalie C. Behague, Anthony Bonato, Melissa A. Huggan, Rehan Malik, Trent G. Marbach:
The iterated local transitivity model for hypergraphs. 106-119
- Hessa Al-Thani, Jon Lee:
Tridiagonal maximum-entropy sampling and tridiagonal masks. 120-138
- Wensheng Sun, Yujun Yang:
Solution to a conjecture on resistance diameter of lexicographic product of paths. 139-148 - Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams. 149-160 - Deyan Zeng, Jian-Hua Yin:
Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture. 161-170
- Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim:
Domination versus edge domination on claw-free graphs. 171-172
- Tomás Peitl, Stefan Szeider:
Are hitting formulas hard for resolution? 173-184 - Eckhard Steffen, Isaak H. Wolf:
Bounds for the chromatic index of signed multigraphs. 185-189 - Qinglan Zhao, Mengran Li, Zhixiong Chen, Baodong Qin, Dong Zheng:
A unified construction of weightwise perfectly balanced Boolean functions. 190-201 - Zhengping Qiu, Zikai Tang, Qiyue Li:
Eccentricity spectral radius of t-clique trees with given diameter. 202-217 - Pranava K. Jha:
Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube. 218-231 - Fei-Huang Chang, Ma-Lian Chia, David Kuo, Sheng-Chyang Liaw, Yi-Xuan Lin:
[1,2]-dimension of graphs. 232-245 - Giuseppe Mazzuoccolo, Gloria Tabarelli, Jean Paul Zerafa:
On the existence of graphs which can colour every regular graph. 246-256
- Lin Sun, Guanglong Yu, Xin Li:
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23. 257-271 - Bin Chen, An Chang:
A note on Seymour's second neighborhood conjecture. 272-277
- Bochuan Lyu, Illya V. Hicks:
Finding biclique partitions of co-chordal graphs. 278-287 - Girija Limaye:
Envy-freeness and relaxed stability for lower-quotas: A parameterized perspective. 288-302 - Mareike Fischer, Tom Niklas Hamann, Kristina Wicke:
How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks. 303-320
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 2025-01-28 22:21 CET 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:
