Mukwembi, Simon On spanning cycles, paths and trees. (English) Zbl 1287.05080 Discrete Appl. Math. 161, No. 13-14, 2217-2222 (2013). MSC: 05C45 05C07 05C40 PDF BibTeX XML Cite \textit{S. Mukwembi}, Discrete Appl. Math. 161, No. 13--14, 2217--2222 (2013; Zbl 1287.05080) Full Text: DOI
Mansour, Toufik; Shattuck, Mark Counting humps and peaks in generalized Motzkin paths. (English) Zbl 1287.05010 Discrete Appl. Math. 161, No. 13-14, 2213-2216 (2013). MSC: 05A15 05A10 PDF BibTeX XML Cite \textit{T. Mansour} and \textit{M. Shattuck}, Discrete Appl. Math. 161, No. 13--14, 2213--2216 (2013; Zbl 1287.05010) Full Text: DOI
Kim, Seog-Jin; Lee, Sang June; Park, Won-Jin Dynamic coloring and list dynamic coloring of planar graphs. (English) Zbl 1287.05046 Discrete Appl. Math. 161, No. 13-14, 2207-2212 (2013). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{S.-J. Kim} et al., Discrete Appl. Math. 161, No. 13--14, 2207--2212 (2013; Zbl 1287.05046) Full Text: DOI
Kianfar, K.; Moslehi, G. A note on “Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date”. (English) Zbl 1291.90096 Discrete Appl. Math. 161, No. 13-14, 2205-2206 (2013). MSC: 90B35 PDF BibTeX XML Cite \textit{K. Kianfar} and \textit{G. Moslehi}, Discrete Appl. Math. 161, No. 13--14, 2205--2206 (2013; Zbl 1291.90096) Full Text: DOI
Ducoffe, Guillaume Hamiltonicity of large generalized de Bruijn cycles. (English) Zbl 1287.05078 Discrete Appl. Math. 161, No. 13-14, 2200-2204 (2013). MSC: 05C45 05C20 05C82 05C38 PDF BibTeX XML Cite \textit{G. Ducoffe}, Discrete Appl. Math. 161, No. 13--14, 2200--2204 (2013; Zbl 1287.05078) Full Text: DOI
Ye, Dong On the anti-Kekulé number and odd cycle transversal of regular graphs. (English) Zbl 1287.05123 Discrete Appl. Math. 161, No. 13-14, 2196-2199 (2013). MSC: 05C70 05C90 05C40 92E10 PDF BibTeX XML Cite \textit{D. Ye}, Discrete Appl. Math. 161, No. 13--14, 2196--2199 (2013; Zbl 1287.05123) Full Text: DOI
Xu, Shou-Jun; Li, Xianyue; Liang, Ronghua Moplex orderings generated by the LexDFs algorithm. (English) Zbl 1287.05153 Discrete Appl. Math. 161, No. 13-14, 2189-2195 (2013). MSC: 05C85 05C69 PDF BibTeX XML Cite \textit{S.-J. Xu} et al., Discrete Appl. Math. 161, No. 13--14, 2189--2195 (2013; Zbl 1287.05153) Full Text: DOI
Wang, Yue-Li; Wu, Kuo-Hua A tight upper bound for 2-rainbow domination in generalized Petersen graphs. (English) Zbl 1286.05127 Discrete Appl. Math. 161, No. 13-14, 2178-2188 (2013). MSC: 05C69 05C15 05C85 PDF BibTeX XML Cite \textit{Y.-L. Wang} and \textit{K.-H. Wu}, Discrete Appl. Math. 161, No. 13--14, 2178--2188 (2013; Zbl 1286.05127) Full Text: DOI
Volkmann, Lutz Complementary cycles in almost regular multipartite tournaments, where one cycle has length four. (English) Zbl 1286.05058 Discrete Appl. Math. 161, No. 13-14, 2169-2177 (2013). MSC: 05C20 05C38 05C45 PDF BibTeX XML Cite \textit{L. Volkmann}, Discrete Appl. Math. 161, No. 13--14, 2169--2177 (2013; Zbl 1286.05058) Full Text: DOI
Vesel, Aleksander Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs. (English) Zbl 1287.05121 Discrete Appl. Math. 161, No. 13-14, 2158-2168 (2013). MSC: 05C70 05C12 05C90 PDF BibTeX XML Cite \textit{A. Vesel}, Discrete Appl. Math. 161, No. 13--14, 2158--2168 (2013; Zbl 1287.05121) Full Text: DOI
van Zuylen, Anke Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems. (English) Zbl 1293.90064 Discrete Appl. Math. 161, No. 13-14, 2142-2157 (2013). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{A. van Zuylen}, Discrete Appl. Math. 161, No. 13--14, 2142--2157 (2013; Zbl 1293.90064) Full Text: DOI
Šumenjak, Tadeja Kraner; Rall, Douglas F.; Tepeh, Aleksandra Rainbow domination in the lexicographic product of graphs. (English) Zbl 1286.05146 Discrete Appl. Math. 161, No. 13-14, 2133-2141 (2013). MSC: 05C76 05C69 PDF BibTeX XML Cite \textit{T. K. Šumenjak} et al., Discrete Appl. Math. 161, No. 13--14, 2133--2141 (2013; Zbl 1286.05146) Full Text: DOI arXiv
Sarkar, Amites; Haenggi, Martin Percolation in the secrecy graph. (English) Zbl 1286.05157 Discrete Appl. Math. 161, No. 13-14, 2120-2132 (2013). MSC: 05C80 60K35 68R10 68M10 PDF BibTeX XML Cite \textit{A. Sarkar} and \textit{M. Haenggi}, Discrete Appl. Math. 161, No. 13--14, 2120--2132 (2013; Zbl 1286.05157) Full Text: DOI arXiv
Prot, D.; Rapine, C. Approximations for the two-machine cross-docking flow shop problem. (English) Zbl 1286.90065 Discrete Appl. Math. 161, No. 13-14, 2107-2119 (2013). MSC: 90B35 05C90 68W25 PDF BibTeX XML Cite \textit{D. Prot} and \textit{C. Rapine}, Discrete Appl. Math. 161, No. 13--14, 2107--2119 (2013; Zbl 1286.90065) Full Text: DOI
Nutov, Zeev Small \(\ell\)-edge-covers in \(k\)-connected graphs. (English) Zbl 1286.05081 Discrete Appl. Math. 161, No. 13-14, 2101-2106 (2013). MSC: 05C40 68W25 PDF BibTeX XML Cite \textit{Z. Nutov}, Discrete Appl. Math. 161, No. 13--14, 2101--2106 (2013; Zbl 1286.05081) Full Text: DOI
Maxová, Jana; Turzík, Daniel Which distance-hereditary graphs are cover-incomparability graphs? (English) Zbl 1286.05039 Discrete Appl. Math. 161, No. 13-14, 2095-2100 (2013). MSC: 05C12 05C75 06A06 PDF BibTeX XML Cite \textit{J. Maxová} and \textit{D. Turzík}, Discrete Appl. Math. 161, No. 13--14, 2095--2100 (2013; Zbl 1286.05039) Full Text: DOI
Mansour, Toufik; Shattuck, Mark A combinatorial approach to a general two-term recurrence. (English) Zbl 1371.11035 Discrete Appl. Math. 161, No. 13-14, 2084-2094 (2013). MSC: 11B37 05A10 05A15 11B65 11B73 PDF BibTeX XML Cite \textit{T. Mansour} and \textit{M. Shattuck}, Discrete Appl. Math. 161, No. 13--14, 2084--2094 (2013; Zbl 1371.11035) Full Text: DOI
Lv, Benjian; Wang, Kaishun The energy of \(q\)-Kneser graphs and attenuated \(q\)-Kneser graphs. (English) Zbl 1286.05096 Discrete Appl. Math. 161, No. 13-14, 2079-2083 (2013). MSC: 05C50 PDF BibTeX XML Cite \textit{B. Lv} and \textit{K. Wang}, Discrete Appl. Math. 161, No. 13--14, 2079--2083 (2013; Zbl 1286.05096) Full Text: DOI
Lu, Hongliang Simplified existence theorems on all fractional \([a,b]\)-factors. (English) Zbl 1286.05139 Discrete Appl. Math. 161, No. 13-14, 2075-2078 (2013). MSC: 05C70 PDF BibTeX XML Cite \textit{H. Lu}, Discrete Appl. Math. 161, No. 13--14, 2075--2078 (2013; Zbl 1286.05139) Full Text: DOI arXiv
Lu, Changhong; Zhou, Qing Path covering number and \(L(2,1)\)-labeling number of graphs. (English) Zbl 1286.05150 Discrete Appl. Math. 161, No. 13-14, 2062-2074 (2013). MSC: 05C78 05C38 PDF BibTeX XML Cite \textit{C. Lu} and \textit{Q. Zhou}, Discrete Appl. Math. 161, No. 13--14, 2062--2074 (2013; Zbl 1286.05150) Full Text: DOI arXiv
Junosza-Szaniawski, Konstanty; Kratochvíl, Jan; Liedloff, Mathieu; Rzążewski, Paweł Determining the \(L(2,1)\)-span in polynomial space. (English) Zbl 1286.05148 Discrete Appl. Math. 161, No. 13-14, 2052-2061 (2013). MSC: 05C78 05C85 05C90 94A40 PDF BibTeX XML Cite \textit{K. Junosza-Szaniawski} et al., Discrete Appl. Math. 161, No. 13--14, 2052--2061 (2013; Zbl 1286.05148) Full Text: DOI arXiv
Junnila, Ville New lower bound for 2-identifying code in the square grid. (English) Zbl 1286.05137 Discrete Appl. Math. 161, No. 13-14, 2042-2051 (2013). MSC: 05C70 94B65 68R10 PDF BibTeX XML Cite \textit{V. Junnila}, Discrete Appl. Math. 161, No. 13--14, 2042--2051 (2013; Zbl 1286.05137) Full Text: DOI arXiv
Jin, Hai-Tao; Sun, Lisa H. On Spieß’s conjecture on harmonic numbers. (English) Zbl 1301.11029 Discrete Appl. Math. 161, No. 13-14, 2038-2041 (2013). MSC: 11B75 05A19 PDF BibTeX XML Cite \textit{H.-T. Jin} and \textit{L. H. Sun}, Discrete Appl. Math. 161, No. 13--14, 2038--2041 (2013; Zbl 1301.11029) Full Text: DOI
Jaehn, Florian; Pesch, Erwin New bounds and constraint propagation techniques for the clique partitioning problem. (English) Zbl 1287.68155 Discrete Appl. Math. 161, No. 13-14, 2025-2037 (2013). MSC: 68T20 05C69 05C70 90C59 PDF BibTeX XML Cite \textit{F. Jaehn} and \textit{E. Pesch}, Discrete Appl. Math. 161, No. 13--14, 2025--2037 (2013; Zbl 1287.68155) Full Text: DOI
Henning, Michael A.; Joubert, Ernst J. Equality in a linear Vizing-like relation that relates the size and total domination number of a graph. (English) Zbl 1286.05121 Discrete Appl. Math. 161, No. 13-14, 2014-2024 (2013). MSC: 05C69 05C76 05C35 PDF BibTeX XML Cite \textit{M. A. Henning} and \textit{E. J. Joubert}, Discrete Appl. Math. 161, No. 13--14, 2014--2024 (2013; Zbl 1286.05121) Full Text: DOI arXiv
Grüter, Steffen; Guo, Yubao; Holtkamp, Andreas Restricted arc-connectivity of bipartite tournaments. (English) Zbl 1287.05052 Discrete Appl. Math. 161, No. 13-14, 2008-2013 (2013). MSC: 05C20 05C40 PDF BibTeX XML Cite \textit{S. Grüter} et al., Discrete Appl. Math. 161, No. 13--14, 2008--2013 (2013; Zbl 1287.05052) Full Text: DOI
Ghebleh, M.; Niepel, L. Locating and identifying codes in circulant networks. (English) Zbl 1286.05119 Discrete Appl. Math. 161, No. 13-14, 2001-2007 (2013). MSC: 05C69 PDF BibTeX XML Cite \textit{M. Ghebleh} and \textit{L. Niepel}, Discrete Appl. Math. 161, No. 13--14, 2001--2007 (2013; Zbl 1286.05119) Full Text: DOI arXiv
Galluccio, Anna; Gentile, Claudio; Ventura, Paolo 2-clique-bond of stable set polyhedra. (English) Zbl 1286.05167 Discrete Appl. Math. 161, No. 13-14, 1988-2000 (2013). MSC: 05C85 52B05 PDF BibTeX XML Cite \textit{A. Galluccio} et al., Discrete Appl. Math. 161, No. 13--14, 1988--2000 (2013; Zbl 1286.05167) Full Text: DOI
Epstein, Leah; Imreh, Csanád; Levin, Asaf Bin covering with cardinality constraints. (English) Zbl 1286.05026 Discrete Appl. Math. 161, No. 13-14, 1975-1987 (2013). MSC: 05B40 68R10 68W27 90C27 PDF BibTeX XML Cite \textit{L. Epstein} et al., Discrete Appl. Math. 161, No. 13--14, 1975--1987 (2013; Zbl 1286.05026) Full Text: DOI
Dulio, P.; Peri, C. Discrete tomography for inscribable lattice sets. (English) Zbl 1286.05027 Discrete Appl. Math. 161, No. 13-14, 1959-1974 (2013). MSC: 05B50 68U10 68R10 92C55 PDF BibTeX XML Cite \textit{P. Dulio} and \textit{C. Peri}, Discrete Appl. Math. 161, No. 13--14, 1959--1974 (2013; Zbl 1286.05027) Full Text: DOI
Dereniowski, Dariusz; Diner, Öznur Yaşar; Dyer, Danny Three-fast-searchable graphs. (English) Zbl 1286.05166 Discrete Appl. Math. 161, No. 13-14, 1950-1958 (2013). MSC: 05C85 68R10 68Q17 PDF BibTeX XML Cite \textit{D. Dereniowski} et al., Discrete Appl. Math. 161, No. 13--14, 1950--1958 (2013; Zbl 1286.05166) Full Text: DOI
Brešar, Boštjan; Jakovac, Marko; Katrenič, Ján; Semanišin, Gabriel; Taranenko, Andrej On the vertex \(k\)-path cover. (English) Zbl 1286.05076 Discrete Appl. Math. 161, No. 13-14, 1943-1949 (2013). MSC: 05C38 PDF BibTeX XML Cite \textit{B. Brešar} et al., Discrete Appl. Math. 161, No. 13--14, 1943--1949 (2013; Zbl 1286.05076) Full Text: DOI
Bonomo, Flavia; Durán, Guillermo; Safe, Martín D.; Wagler, Annegret K. On minimal forbidden subgraph characterizations of balanced graphs. (English) Zbl 1286.05105 Discrete Appl. Math. 161, No. 13-14, 1925-1942 (2013). MSC: 05C60 05C76 05C17 PDF BibTeX XML Cite \textit{F. Bonomo} et al., Discrete Appl. Math. 161, No. 13--14, 1925--1942 (2013; Zbl 1286.05105) Full Text: DOI
Bojilov, Asen; Caro, Yair; Hansberg, Adriana; Nenov, Nedyalko Partitions of graphs into small and large sets. (English) Zbl 1286.05130 Discrete Appl. Math. 161, No. 13-14, 1912-1924 (2013). MSC: 05C70 PDF BibTeX XML Cite \textit{A. Bojilov} et al., Discrete Appl. Math. 161, No. 13--14, 1912--1924 (2013; Zbl 1286.05130) Full Text: DOI arXiv
Belohlavek, Radim; Vychodil, Vilem Closure-based constraints in formal concept analysis. (English) Zbl 1312.68180 Discrete Appl. Math. 161, No. 13-14, 1894-1911 (2013). MSC: 68T30 06A15 PDF BibTeX XML Cite \textit{R. Belohlavek} and \textit{V. Vychodil}, Discrete Appl. Math. 161, No. 13--14, 1894--1911 (2013; Zbl 1312.68180) Full Text: DOI
Belmonte, Rémy; van’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. Characterizing graphs of small carving-width. (English) Zbl 1286.05036 Discrete Appl. Math. 161, No. 13-14, 1888-1893 (2013). MSC: 05C12 05C05 05C85 05C78 PDF BibTeX XML Cite \textit{R. Belmonte} et al., Discrete Appl. Math. 161, No. 13--14, 1888--1893 (2013; Zbl 1286.05036) Full Text: DOI
Beardon, A. F. Resolving the hypercube. (English) Zbl 1286.05111 Discrete Appl. Math. 161, No. 13-14, 1882-1887 (2013). MSC: 05C65 PDF BibTeX XML Cite \textit{A. F. Beardon}, Discrete Appl. Math. 161, No. 13--14, 1882--1887 (2013; Zbl 1286.05111) Full Text: DOI
Asveld, Peter R. J. Permuting operations on strings and the distribution of their prime numbers. (English) Zbl 06287211 Discrete Appl. Math. 161, No. 13-14, 1868-1881 (2013). MSC: 11A41 PDF BibTeX XML Cite \textit{P. R. J. Asveld}, Discrete Appl. Math. 161, No. 13--14, 1868--1881 (2013; Zbl 06287211) Full Text: DOI
Arumugam, S.; Jose, Bibin K.; Bujtás, Csilla; Tuza, Zsolt Equality of domination and transversal numbers in hypergraphs. (English) Zbl 1286.05115 Discrete Appl. Math. 161, No. 13-14, 1859-1867 (2013). MSC: 05C69 05C65 05C75 68Q17 PDF BibTeX XML Cite \textit{S. Arumugam} et al., Discrete Appl. Math. 161, No. 13--14, 1859--1867 (2013; Zbl 1286.05115) Full Text: DOI
Epstein, Leah; Feldman, Michal; Tamir, Tami; Witkowski, Łukasz; Witkowski, Marcin Approximate strong equilibria in job scheduling games with two uniformly related machines. (English) Zbl 1287.90022 Discrete Appl. Math. 161, No. 13-14, 1843-1858 (2013). MSC: 90B35 91A05 91A80 68M20 PDF BibTeX XML Cite \textit{L. Epstein} et al., Discrete Appl. Math. 161, No. 13--14, 1843--1858 (2013; Zbl 1287.90022) Full Text: DOI
Deineko, Vladimir G.; Woeginger, Gerhard J. Two hardness results for core stability in hedonic coalition formation games. (English) Zbl 1285.91040 Discrete Appl. Math. 161, No. 13-14, 1837-1842 (2013). MSC: 91B14 68Q17 91A12 PDF BibTeX XML Cite \textit{V. G. Deineko} and \textit{G. J. Woeginger}, Discrete Appl. Math. 161, No. 13--14, 1837--1842 (2013; Zbl 1285.91040) Full Text: DOI
Cranston, Daniel W.; Kinnersley, William B.; O, Suil; West, Douglas B. Game matching number of graphs. (English) Zbl 1286.05133 Discrete Appl. Math. 161, No. 13-14, 1828-1836 (2013). MSC: 05C70 05C35 05C57 90C47 91A05 PDF BibTeX XML Cite \textit{D. W. Cranston} et al., Discrete Appl. Math. 161, No. 13--14, 1828--1836 (2013; Zbl 1286.05133) Full Text: DOI arXiv
Kozak, Adam; Głowacki, Tomasz; Formanowicz, Piotr On a generalized model of labeled graphs. (English) Zbl 1287.05136 Discrete Appl. Math. 161, No. 13-14, 1818-1827 (2013). MSC: 05C78 05C90 92C40 92D20 PDF BibTeX XML Cite \textit{A. Kozak} et al., Discrete Appl. Math. 161, No. 13--14, 1818--1827 (2013; Zbl 1287.05136) Full Text: DOI
Martin, Daniel M.; Thatte, Bhalchandra D. The maximum agreement subtree problem. (English) Zbl 1286.05029 Discrete Appl. Math. 161, No. 13-14, 1805-1817 (2013). MSC: 05C05 05C35 92D15 PDF BibTeX XML Cite \textit{D. M. Martin} and \textit{B. D. Thatte}, Discrete Appl. Math. 161, No. 13--14, 1805--1817 (2013; Zbl 1286.05029) Full Text: DOI arXiv
Catanzaro, Daniele; Labbé, Martine; Pesenti, Raffaele The balanced minimum evolution problem under uncertain data. (English) Zbl 1288.90071 Discrete Appl. Math. 161, No. 13-14, 1789-1804 (2013). MSC: 90C27 PDF BibTeX XML Cite \textit{D. Catanzaro} et al., Discrete Appl. Math. 161, No. 13--14, 1789--1804 (2013; Zbl 1288.90071) Full Text: DOI