default search action
Discrete Applied Mathematics, Volume 223
Volume 223, May 2017
- Mushtaq A. Bhat:
Energy of weighted digraphs. 1-14 - Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick:
Efficient domination for classes of P6-free graphs. 15-27 - Christoph Brause, Rastislav Krivos-Bellus:
On a relation between k-path partition and k-path vertex cover. 28-38 - Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang:
Completing colored graphs to meet a target property. 39-51 - Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Partitioning the vertices of a cubic graph into two total dominating sets. 52-63 - Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
Geodetic convexity parameters for (q, q-4)-graphs. 64-71 - Lihua Feng, Xiaomin Zhu, Weijun Liu:
Wiener index, Harary index and graph properties. 72-83 - Balázs Keszegh, Xuding Zhu:
Choosability and paintability of the lexicographic product of graphs. 84-90 - Masashi Kiyomi, Yota Otachi:
Alliances in graphs of bounded clique-width. 91-97 - V. Kumaran, R. Swarnalatha:
Bounds for the probability of union of events following monotonic distribution. 98-119 - Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda:
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound. 120-134 - Liming Xiong:
Characterization of forbidden subgraphs for the existence of even factors in a graph. 135-139 - Lihua You, Liyong Ren, Guanglong Yu:
Distance and distance signless Laplacian spread of connected graphs. 140-147 - Enqiang Zhu, Jin Xu:
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable. 148-153
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.