default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 162
Volume 162, January 2014
- Yu. M. Movsisyan, V. A. Aslanyan:
A functional completeness theorem for De Morgan functions. 1-16 - Yin Zhang, Meicheng Liu, Dongdai Lin:
On the immunity of rotation symmetric Boolean functions against fast algebraic attacks. 17-27
- Nikolai S. Kukushkin
:
Novshek's trick as a polynomial algorithm. 28-31 - Ting-Yu Lin, Shi-Chun Tsai, Wen-Nung Tsai, Jong-Chuang Tsay:
More on the one-dimensional sliding-coin puzzle. 32-41 - F. Javier Martínez-de-Albéniz, Carles Rafels:
Cooperative assignment games with the inverse Monge property. 42-50
- Kira V. Adaricheva, James B. Nation:
On implicational bases of closure systems with unique critical sets. 51-69 - Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni:
Recognizing vertex intersection graphs of paths on bounded degree trees. 70-77 - Ágnes Backhausz, Tamás F. Móri:
A random model of publication activity. 78-89 - Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano:
On the connectivity and restricted edge-connectivity of 3-arc graphs. 90-99 - Katy E. Beeler, Kenneth S. Berenhaut, Joshua N. Cooper, Meagan N. Hunter, Peter S. Barr:
Deterministic walks with choice. 100-107 - Siham Bekkai:
Minimum degree, independence number and pseudo [2, b]-factors in graphs. 108-114 - Daniel Berend, Ronen I. Brafman, Shimon Cohen, Solomon Eyal Shimony, Shira Zucker:
Optimal ordering of independent tests with precedence constraints. 115-127 - Peter Butkovic, Marie MacCaig:
On the integer max-linear programming problem. 128-141 - Junqing Cai, Hao Li:
A new sufficient condition for pancyclability of graphs. 142-148 - Ching-Lueh Chang:
Hardness of learning loops, monoids, and semirings. 149-158 - Min Chen, André Raspaud:
On (3, 2)*-choosability of planar graphs without adjacent short cycles. 159-166 - Daniel W. Cranston, Riste Skrekovski:
Sufficient sparseness conditions for G2 to be (Δ+1)-choosable, when Δ≥5. 167-176 - Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz:
Automated generation of conjectures on forbidden subgraph characterization. 177-194 - Elaine M. Eschen, Xiaoqiang Wang:
Algorithms for unipolar and generalized split graphs. 195-201 - Tatsuya Fukami, Norikazu Takahashi:
New classes of clustering coefficient locally maximizing graphs. 202-213 - Steven Gay, François Fages, Thierry Martinez, Sylvain Soliman, Christine Solnon:
On the subgraph epimorphism problem. 214-228 - Martin Grötschel, Rüdiger Stephan:
Characterization of facets of the hop constrained chain polytope via dynamic programming. 229-246 - Ivan Gutman, Roberto Cruz, Juan Rada:
Wiener index of Eulerian graphs. 247-250 - Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
Lower bounds for treewidth of product graphs. 251-258 - Young Soo Kwon, Jaeun Lee:
Perfect domination sets in Cayley graphs. 259-263 - Giuseppe Mazzuoccolo:
On the excessive [m]-index of a tree. 264-270 - Masahiko Murakami, Fumio Takeshita, Seiichi Tani:
Computing HOMFLY polynomials of 2-bridge links from 4-plat representation. 271-284 - Caleb Petrie:
(F, I)-security in graphs. 285-295 - Alison Thomson, Sanming Zhou:
Rotational circulant graphs. 296-305 - Jinquan Xu, Zhi-Hong Chen, Hong-Jian Lai, Meng Zhang:
Spanning trails in essentially 4-edge-connected graphs. 306-313 - Bing Xue, Liancui Zuo, Guanghui Wang, Guojun Li:
Shortest paths in Sierpiński graphs. 314-321 - Jin Yan, Yunshu Gao, Beibei Zhang:
Graph partition into small cliques. 322-327 - Zhidan Yan, Wei Wang:
Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs. 328-333 - Heping Zhang, Jinzhuan Cai:
On the global forcing number of hexagonal systems. 334-347 - Lianzhu Zhang, Weifan Wang, Ko-Wei Lih:
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph. 348-354 - Haiyang Zhu, Lifeng Hou, Wei Chen, Xinzhong Lü:
The L(p, q)-labelling of planar graphs without 4-cycles. 355-363 - Zhongxun Zhu, Liansheng Tan, Zhongyi Qiu:
Tricyclic graph with maximal Estrada index. 364-372
- Niranjan Balachandran, Srimanta Bhattacharya:
On an extremal hypergraph problem related to combinatorial batch codes. 373-380 - Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak:
On the structure of arbitrarily partitionable graphs with given connectivity. 381-385 - Tomica Divnic, Milica Milivojevic, Ljiljana Pavlovic:
Extremal graphs for the geometric-arithmetic index with given minimum degree. 386-390 - Frank Gurski, Magnus Roos:
Binary linear programming solutions and non-approximability for control problems in voting systems. 391-398 - Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Independent domination in subcubic bipartite graphs of girth at least six. 399-403 - Kuo-Ching Huang, Ko-Wei Lih:
Nordhaus-Gaddum-type relations of three graph coloring parameters. 404-408 - Vadim E. Levit, Eugen Mandrescu:
On the intersection of all critical sets of a unicyclic graph. 409-414 - Shuli Li, Weigen Yan:
The matching energy of graphs with given parameters. 415-420 - Andrzej Zak:
A generalization of an independent set with application to (Kp;k)-stable graphs. 421-427
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 2026-08-02 01:05 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
