default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Art of Discrete and Applied Mathematics, Volume 8
Volume 8, Number 1, 2025
- Leah Wrenn Berman, Gábor Gévay, Tomaz Pisanski:
The Gray graph is a unit-distance graph. 1 - Marco Buratti, Mikhail E. Muzychuk:
Some bounds on the number of cyclic Steiner 2-designs. 1 - Wilfried Imrich, Rafal Kalinowski
, Monika Pilsniak:
Hierarchical product graphs and their prime factorization. 1 - Paul D. Manuel, R. Prabha, Sandi Klavzar:
Generalization of edge general position problem. 1 - Dean Crnkovic, Vedrana Mikulic Crnkovic, Andrea Svob, Matea Zubovic Zutolija:
Transitive regular q-analogs of graphs. 1 - Shirin Alimirzaei, Dave Witte Morris:
Colour-permuting automorphisms of complete Cayley graphs. 1 - Mohammad Ghebleh, Salem M. Al-Yakoob, Ali A. Kanso, Dragan Stevanovic:
Reinforcement learning for graph theory, II. Small Ramsey numbers. 1 - Janez Konc, Dusanka Janezic:
Advanced clique algorithms for protein product graphs. 1 - Barbara Gatti, Francesco Ghiandoni, Gábor Korchmáros:
The invariant of PGU(3,q) in the Hermitian function field. 1
Volume 8, Number 2, 2025
- Gover E. C. Guzman, Marcos E. González Laffitte, André Fujita, Peter F. Stadler:
Primitive, edge-short, isometric, and pantochordal cycles. 2 - Jean-Luc Baril, Pamela E. Harris, Kimberly J. Harry, Matt McClinton, José Luis Ramírez:
Enumerating runs, valleys, and peaks in Catalan words. 2 - Manoj Changat, Ameera Vaheeda Shanavas, Peter F. Stadler:
Transit functions and clustering systems. 2 - Roberto Cruz, Andrés David Santamaría-Galvis:
Extreme hollow hexagons with respect to the Mostar index. 1 - Ted Dobson, Joy Morris, Pablo Spiga:
Groups with elements of order 8 do not have the DCI property. 2 - Shannon Overbay, Samuel S. Joslin, Paul C. Kainen:
All bipartite circulants are dispersable. 2 - Fatma El-Safty:
Laplacian polynomial and Kirchhoff index of some graphs generated by a cycle. 2 - John Haslegrave:
The extremal generalised Randić index for a given degree range. 2 - Jason P. Smith, Emad Zahedi:
On distance preserving and sequentially distance preserving graphs. 2 - Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov:
Isomorphism testing of k-spanning tournaments is fixed parameter tractable. 2
Volume 8, Number 3, 2025
- Gabriela Araujo-Pardo, Marston Conder, Natalia Garcia-Colin, György Kiss, Dimitri Leemans:
A note on girth-diameter cages. 3 - György Kiss:
Geometric constructions of small regular graphs with girth 7. 3 - Marco Buratti, Francesca Merola, Anamari Nakic, Christian Rubio-Montiel:
Banff designs: difference methods for coloring incidence graphs. 3 - Gabriela Araujo-Pardo, György Kiss, István Porupsánszki:
On extremal (almost) edge-girth-regular graphs. 3 - Tatiana Jajcayová, Robert Jajcay:
Totally regular mixed graphs constructed from the CD(n,q) graphs of Lazebnik, Ustimenko and Woldar. 3
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-12-04 22:08 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:
