default search action
Discrete Applied Mathematics, Volume 229
Volume 229, October 2017
- Wen An Liu, Ming Yue Wang:
Multi-player Wythoff's game and its variants. 1-16
- Eda Uyanik, Olivier Sobrie, Vincent Mousseau, Marc Pirlot:
Enumerating and categorizing positive Boolean functions separable by a k-additive capacity. 17-30
- Boris Brimkov, Illya V. Hicks:
Complexity and computation of connected zero forcing. 31-45 - Sebastian M. Cioaba, Randall J. Elzinga, Michelle Markiewitz, Kevin N. Vander Meulen, Trevor Vanderwoerd:
Addressing graph products and distance-regular graphs. 46-54 - Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs. 55-63 - Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. 64-81 - Shuhong Gao, Fiona Knoll, Felice Manganiello, Gretchen L. Matthews:
Codes for distributed storage from 3-regular graphs. 82-89 - Xiaomin Hu, Bin Zhao, Yingzhi Tian, Jixiang Meng:
Matching preclusion for k-ary n-cubes with odd k ≥ 3. 90-100 - Longcheng Liu, Wenhao Zheng, Chao Li:
Inverse minimum flow problem under the weighted sum-type Hamming distance. 101-112 - Lianying Miao, Shiyou Pang, Fang Liu, Eryan Wang, Xiaoqing Guo:
On the extremal values of the eccentric distance sum of trees with a given domination number. 113-120 - Sara Nicoloso, Ugo Pietropaoli:
Vertex-colouring of 3-chromatic circulant graphs. 121-138 - Huihui Zhang, Shuchao Li:
On the Laplacian spectral radius of bipartite graphs with fixed order and size. 139-147
- Zbigniew R. Bogdanowicz:
On decomposition of the Cartesian product of directed cycles into cycles of equal lengths. 148-150 - Nathan J. Bowler, Joshua Erde, Florian Lehner, Martin Merker, Max Pitz, Konstantinos S. Stavropoulos:
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. 151-153 - Helin Gong, Shuli Li:
The number of spanning trees of a family of 2-separable weighted graphs. 154-160 - John Martinovic, Guntram Scheithauer:
An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case. 161-167
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.