default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 369
Volume 369, 2025
- Priyamvada
:
Tight bounds on odd chromatic number of some standard graph products. 1-13 - Litao Guo, Wantao Ning:
Connectivity and super connectivity of enhanced folded hypercube-like networks. 14-19 - Andrea Burgess, Danny Dyer, Mozhgan Farahani:
An introduction to the deduction number. 20-27 - David Bryant, Katharina T. Huber, Vincent Moulton, Andreas Spillner:
Buneman graphs, partial splits and subtree distances. 28-44 - Hongjun Wei, Yuan Gao, Jinjiang Yuan:
Unary NP-hardness of transportation and batching scheduling to minimize the total weighted completion time. 45-52 - Erika M. M. Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sulamita Klein:
On the absolute and relative oriented clique problems' time complexity. 53-65 - Filippo Brunelli, Alessio Conte, Roberto Grossi, Andrea Marino:
Output-sensitive enumeration of maximal cliques in temporal graphs. 66-77 - Iswar Mahato:
Characterization of trees with second minimum eccentricity energy. 78-87 - Maoqun Wang, Sitong Guan, Bo Zhang:
Degree sum condition for vertex-disjoint triangles and pentagons. 88-95
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-05-17 00:28 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:
