default search action
Discrete Applied Mathematics, Volume 226
Volume 226, July 2017
- Nicola Apollonio, Paolo Giulio Franciosa:
On computing the Galois lattice of bipartite distance hereditary graphs. 1-9 - Kristóf Bérczi, Yusuke Kobayashi:
An algorithm for identifying cycle-plus-triangles graphs. 10-16 - Daniel Berend, Ronen I. Brafman, Solomon Eyal Shimony, Shira Zucker, Shimon Cohen:
Optimal ordering of statistically dependent tests. 17-31 - Mushtaq A. Bhat, Shariefuddin Pirzada:
Unicyclic signed graphs with minimal energy. 32-39 - Zbigniew R. Bogdanowicz:
Isomorphism between circulants and Cartesian products of cycles. 40-43 - Hortensia Galeana-Sánchez, Mika Olsen:
Infinite quasi-transitive digraphs with domination number 2. 44-50 - Momoko Hayamizu, Kenji Fukumizu:
On minimum spanning tree-like metric spaces. 51-57 - Michael A. Henning, Douglas F. Rall:
Trees with equal total domination and game total domination numbers. 58-70 - Rafal Kalinowski:
Dense on-line arbitrarily partitionable graphs. 71-77 - Stefan Kratsch, Martin Milanic:
On the complexity of the identifiable subgraph problem, revisited. 78-86 - Muhuo Liu, Baogang Xu:
On partitions of graphs under degree constraints. 87-93 - Toufik Mansour, Mark Shattuck:
Nine classes of permutations enumerated by binomial transform of Fine's sequence. 94-105 - Martin Pergel, Pawel Rzazewski:
On edge intersection graphs of paths with 2 bends. 106-116 - Petros A. Petrosyan, Hrant Khachatrian:
Further results on the deficiency of graphs. 117-126 - Elif Saygi, Ömer Egecioglu:
q-cube enumerator polynomial of Fibonacci cubes. 127-137 - Munevver Mine Subasi, Ersoy Subasi, Ahmed Binmahfoudh, András Prékopa:
New bounds for the probability that at least k-out-of-n events occur with unimodal distributions. 138-157 - Fangxia Wang, Baoyindureng Wu, Xinhui An:
A -decomposition of tournaments and bipartite digraphs. 158-165
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.