EUVIMED · CrossrefJournal
Discrete Applied Mathematics
ISSN 0166-218X · Elsevier BV
Latest articles
On Sachs-critical graphs: Characterization, structure, and criticality index
Two results on Anti-Ramsey numbers in complete split graphs
A sharp bound on the multiplicity of 1 as a Laplacian eigenvalue in terms of the induced matching number
Almost complete graphs determined by Laplacian hook immanantal polynomials
Rainbow multipartite 4-cycles in complete multipartite graphs
Backbone colouring of chordal graphs
Sharp bounds for the difference between the Randić index and the matching number of subcubic graphs
A new cryptanalytic attack on an RSA variant arising from cubic pell curves
Extremal graphs with no subgraph admitting k+1 edge-disjoint spanning trees
Fault-free Hamiltonian cycles of balanced hypercubes with more edge faults
Approximation and FPT algorithms for finding DM-irreducible spanning subgraphs
Strong fractional coloring of planar graphs without 4-cycles and without 6-cycles adjacent to triangles
A note on piercing discrete rectangles
Bound vertices on longest paths between two vertices in fork-free graphs
Max-bisections in graphs without (t,s,4)-fan
On the 2-energy of graphs and their complements
Characterizing (P≥2,k)-factor critical graphs via the size and Aα-spectral radius
The maximum spectral radius of graphs with given integrity and bounded connectivity
Rainbow C4⃗’s in arc-colored digraphs
Anti-Ramsey number of intersecting odd cycles
Restricted maximum matching augmentation in colored graphs
Weak degeneracy of planar graphs forbidding four cycle lengths
On the TGP-colorable subsets of finite cyclic groups: Complete classification and exact enumeration
Diagonal Ramsey numbers for wheels
Maximal Q-index: Graphs without t edge-disjoint triangles
Enumeration of Cayley graphs over a nonabelian group of order 8p
The Ramsey–Paris–Harrington number for the complete graph of order five
Thin divisible design graphs: An interplay between fixed-point free involutions of (v,k,λ)-graphs and symmetric weighing matrices
Edge and spectral conditions for matching-k-covers in graphs
PBIB-designs arising from diametral paths in the local graphs of tight distance-regular graphs
Volumes
2027 · 1282026 · 6662025 · 4822024 · 4622023 · 3442022 · 4152021 · 4002020 · 4392019 · 4752018 · 4082017 · 4152016 · 3882015 · 3172014 · 4442013 · 3312012 · 2942011 · 2502010 · 2522009 · 4082008 · 3422007 · 2752006 · 2892005 · 2482004 · 3492003 · 3212002 · 1892001 · 1742000 · 1711999 · 1821998 · 1871997 · 2271996 · 1711995 · 2071994 · 2181993 · 1841992 · 1811991 · 1221990 · 1281989 · 791988 · 116
EUVIMED