Tavakoli, M.; Rahbarnia, F.; Ashrafi, A. R. Further results on hierarchical product of graphs. (English) Zbl 1262.05134 Discrete Appl. Math. 161, No. 7-8, 1162-1167 (2013). MSC: 05C76 05C12 05C50 PDFBibTeX XMLCite \textit{M. Tavakoli} et al., Discrete Appl. Math. 161, No. 7--8, 1162--1167 (2013; Zbl 1262.05134) Full Text: DOI
Kowalik, Łukasz; Pilipczuk, Marcin; Suchan, Karol Towards optimal kernel for connected vertex cover in planar graphs. (English) Zbl 1263.05021 Discrete Appl. Math. 161, No. 7-8, 1154-1161 (2013). MSC: 05C10 05C40 05C70 PDFBibTeX XMLCite \textit{Ł. Kowalik} et al., Discrete Appl. Math. 161, No. 7--8, 1154--1161 (2013; Zbl 1263.05021) Full Text: DOI arXiv
Klavžar, Sandi; Nadjafi-Arani, M. J. Wiener index versus Szeged index in networks. (English) Zbl 1262.05039 Discrete Appl. Math. 161, No. 7-8, 1150-1153 (2013). MSC: 05C12 05C10 05C82 PDFBibTeX XMLCite \textit{S. Klavžar} and \textit{M. J. Nadjafi-Arani}, Discrete Appl. Math. 161, No. 7--8, 1150--1153 (2013; Zbl 1262.05039) Full Text: DOI
Jackson, Bill; Jordán, Tibor; Király, Csaba Strongly rigid tensegrity graphs on the line. (English) Zbl 1262.05127 Discrete Appl. Math. 161, No. 7-8, 1147-1149 (2013). MSC: 05C70 52C25 PDFBibTeX XMLCite \textit{B. Jackson} et al., Discrete Appl. Math. 161, No. 7--8, 1147--1149 (2013; Zbl 1262.05127) Full Text: DOI
Gangopadhyay, Sugata Affine inequivalence of cubic Maiorana-McFarland type bent functions. (English) Zbl 1279.06010 Discrete Appl. Math. 161, No. 7-8, 1141-1146 (2013). MSC: 06E30 05B10 PDFBibTeX XMLCite \textit{S. Gangopadhyay}, Discrete Appl. Math. 161, No. 7--8, 1141--1146 (2013; Zbl 1279.06010) Full Text: DOI
Galčík, František; Katrenič, Ján A note on approximating the \(b\)-chromatic number. (English) Zbl 1262.05051 Discrete Appl. Math. 161, No. 7-8, 1137-1140 (2013). MSC: 05C15 PDFBibTeX XMLCite \textit{F. Galčík} and \textit{J. Katrenič}, Discrete Appl. Math. 161, No. 7--8, 1137--1140 (2013; Zbl 1262.05051) Full Text: DOI
Zamfirescu, Carol T. (2)-pancyclic graphs. (English) Zbl 1262.05090 Discrete Appl. Math. 161, No. 7-8, 1128-1136 (2013). MSC: 05C38 05C40 PDFBibTeX XMLCite \textit{C. T. Zamfirescu}, Discrete Appl. Math. 161, No. 7--8, 1128--1136 (2013; Zbl 1262.05090) Full Text: DOI
Yin, Jian-Hua An extension of A.R. Rao’s characterization of potentially \(K_{m+1}\)-graphic sequences. (English) Zbl 1263.05017 Discrete Appl. Math. 161, No. 7-8, 1118-1127 (2013). MSC: 05C07 PDFBibTeX XMLCite \textit{J.-H. Yin}, Discrete Appl. Math. 161, No. 7--8, 1118--1127 (2013; Zbl 1263.05017) Full Text: DOI
Richard, Adrien; Ruet, Paul From kernels in directed graphs to fixed points and negative cycles in Boolean networks. (English) Zbl 1315.05068 Discrete Appl. Math. 161, No. 7-8, 1106-1117 (2013). MSC: 05C20 05C38 05C60 PDFBibTeX XMLCite \textit{A. Richard} and \textit{P. Ruet}, Discrete Appl. Math. 161, No. 7--8, 1106--1117 (2013; Zbl 1315.05068) Full Text: DOI
Park, Jung-Heum; Ihm, Insung Strong matching preclusion under the conditional fault model. (English) Zbl 1262.05130 Discrete Appl. Math. 161, No. 7-8, 1093-1105 (2013). MSC: 05C70 05C65 PDFBibTeX XMLCite \textit{J.-H. Park} and \textit{I. Ihm}, Discrete Appl. Math. 161, No. 7--8, 1093--1105 (2013; Zbl 1262.05130) Full Text: DOI
Panda, B. S.; Paul, S. Liar’s domination in graphs: complexity and algorithm. (English) Zbl 1263.05074 Discrete Appl. Math. 161, No. 7-8, 1085-1092 (2013). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{B. S. Panda} and \textit{S. Paul}, Discrete Appl. Math. 161, No. 7--8, 1085--1092 (2013; Zbl 1263.05074) Full Text: DOI
Padró, Carles; Vázquez, Leonor; Yang, An Finding lower bounds on the complexity of secret sharing schemes by linear programming. (English) Zbl 1262.68049 Discrete Appl. Math. 161, No. 7-8, 1072-1084 (2013). MSC: 68Q25 90C05 94A62 PDFBibTeX XMLCite \textit{C. Padró} et al., Discrete Appl. Math. 161, No. 7--8, 1072--1084 (2013; Zbl 1262.68049) Full Text: DOI
Lin, Yo-Lin; Juan, Justie Su-Tzu; Wang, Yue-Li Finding the edge ranking number through vertex partitions. (English) Zbl 1263.05032 Discrete Appl. Math. 161, No. 7-8, 1067-1071 (2013). MSC: 05C15 05C70 PDFBibTeX XMLCite \textit{Y.-L. Lin} et al., Discrete Appl. Math. 161, No. 7--8, 1067--1071 (2013; Zbl 1263.05032) Full Text: DOI
Lin, Wu-Hsiung; Chang, Gerard J. \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture. (English) Zbl 1263.05031 Discrete Appl. Math. 161, No. 7-8, 1060-1066 (2013). MSC: 05C15 PDFBibTeX XMLCite \textit{W.-H. Lin} and \textit{G. J. Chang}, Discrete Appl. Math. 161, No. 7--8, 1060--1066 (2013; Zbl 1263.05031) Full Text: DOI
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. Normal Helly circular-arc graphs and its subclasses. (English) Zbl 1263.05064 Discrete Appl. Math. 161, No. 7-8, 1037-1059 (2013). MSC: 05C62 05C75 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Discrete Appl. Math. 161, No. 7--8, 1037--1059 (2013; Zbl 1263.05064) Full Text: DOI
Le, Van Bang; Rautenbach, Dieter Integral mixed unit interval graphs. (English) Zbl 1262.05107 Discrete Appl. Math. 161, No. 7-8, 1028-1036 (2013). MSC: 05C62 05C75 PDFBibTeX XMLCite \textit{V. B. Le} and \textit{D. Rautenbach}, Discrete Appl. Math. 161, No. 7--8, 1028--1036 (2013; Zbl 1262.05107) Full Text: DOI
Kuziak, Dorota; Yero, Ismael G.; Rodríguez-Velázquez, Juan A. On the strong metric dimension of corona product graphs and join graphs. (English) Zbl 1262.05133 Discrete Appl. Math. 161, No. 7-8, 1022-1027 (2013). MSC: 05C76 05C12 PDFBibTeX XMLCite \textit{D. Kuziak} et al., Discrete Appl. Math. 161, No. 7--8, 1022--1027 (2013; Zbl 1262.05133) Full Text: DOI arXiv
Konsowa, Mokhtar; Al-Awadhi, Fahimah; Telcs, András Commute times of random walks on trees. (English) Zbl 1271.05090 Discrete Appl. Math. 161, No. 7-8, 1014-1021 (2013). Reviewer: Ove Frank (Stockholm) MSC: 05C81 05C05 05C80 60G50 60K37 PDFBibTeX XMLCite \textit{M. Konsowa} et al., Discrete Appl. Math. 161, No. 7--8, 1014--1021 (2013; Zbl 1271.05090) Full Text: DOI
Hellmuth, Marc On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs. (English) Zbl 1262.05054 Discrete Appl. Math. 161, No. 7-8, 1006-1013 (2013). MSC: 05C15 05C62 05C76 68Q25 05C38 PDFBibTeX XMLCite \textit{M. Hellmuth}, Discrete Appl. Math. 161, No. 7--8, 1006--1013 (2013; Zbl 1262.05054) Full Text: DOI arXiv
Gao, Ze-Tu; Yin, Jian-Hua On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs. (English) Zbl 1262.05085 Discrete Appl. Math. 161, No. 7-8, 999-1005 (2013). MSC: 05C35 05C57 PDFBibTeX XMLCite \textit{Z.-T. Gao} and \textit{J.-H. Yin}, Discrete Appl. Math. 161, No. 7--8, 999--1005 (2013; Zbl 1262.05085) Full Text: DOI
Feldmann, Andreas Emil; Das, Shantanu; Widmayer, Peter Corner cuts are close to optimal: from solid grids to polygons and back. (English) Zbl 1262.05125 Discrete Appl. Math. 161, No. 7-8, 970-998 (2013). MSC: 05C70 05C10 68R10 68P05 PDFBibTeX XMLCite \textit{A. E. Feldmann} et al., Discrete Appl. Math. 161, No. 7--8, 970--998 (2013; Zbl 1262.05125) Full Text: DOI
Eades, Peter; Liotta, Giuseppe Right angle crossing graphs and 1-planarity. (English) Zbl 1408.05042 Discrete Appl. Math. 161, No. 7-8, 961-969 (2013). MSC: 05C10 05C62 05C35 05C76 68R10 PDFBibTeX XMLCite \textit{P. Eades} and \textit{G. Liotta}, Discrete Appl. Math. 161, No. 7--8, 961--969 (2013; Zbl 1408.05042) Full Text: DOI
Divnić, Tomica R.; Pavlović, Ljiljana R. Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index. (English) Zbl 1263.05050 Discrete Appl. Math. 161, No. 7-8, 953-960 (2013). MSC: 05C35 05C07 05C90 90C27 92E10 PDFBibTeX XMLCite \textit{T. R. Divnić} and \textit{L. R. Pavlović}, Discrete Appl. Math. 161, No. 7--8, 953--960 (2013; Zbl 1263.05050) Full Text: DOI
Dejter, Italo J. Worst-case efficient dominating sets in digraphs. (English) Zbl 1263.05069 Discrete Appl. Math. 161, No. 7-8, 944-952 (2013). MSC: 05C69 05C20 05C25 PDFBibTeX XMLCite \textit{I. J. Dejter}, Discrete Appl. Math. 161, No. 7--8, 944--952 (2013; Zbl 1263.05069) Full Text: DOI arXiv
Chu, An-Chiang; Wu, Bang Ye; Chao, Kun-Mao A linear-time algorithm for finding an edge-partition with max-min ratio at most two. (English) Zbl 1262.05144 Discrete Appl. Math. 161, No. 7-8, 932-943 (2013). MSC: 05C85 05C70 05C05 05C22 05C35 PDFBibTeX XMLCite \textit{A.-C. Chu} et al., Discrete Appl. Math. 161, No. 7--8, 932--943 (2013; Zbl 1262.05144) Full Text: DOI
Chen, Min; Raspaud, André Planar graphs without 4- and 5-cycles are acyclically 4-choosable. (English) Zbl 1262.05029 Discrete Appl. Math. 161, No. 7-8, 921-931 (2013). MSC: 05C10 05C15 05C38 PDFBibTeX XMLCite \textit{M. Chen} and \textit{A. Raspaud}, Discrete Appl. Math. 161, No. 7--8, 921--931 (2013; Zbl 1262.05029) Full Text: DOI
Brauner, Nadia; Gravier, Sylvain; Kronek, Louis-Philippe; Meunier, Frédéric LAD models, trees, and an analog of the fundamental theorem of arithmetic. (English) Zbl 1318.92019 Discrete Appl. Math. 161, No. 7-8, 909-920 (2013). MSC: 92C50 05C90 PDFBibTeX XMLCite \textit{N. Brauner} et al., Discrete Appl. Math. 161, No. 7--8, 909--920 (2013; Zbl 1318.92019) Full Text: DOI
Bazgan, Cristina; Chopin, Morgan; Ries, Bernard The firefighter problem with more than one firefighter on trees. (English) Zbl 1263.05068 Discrete Appl. Math. 161, No. 7-8, 899-908 (2013). MSC: 05C69 05C85 05C05 68Q25 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Discrete Appl. Math. 161, No. 7--8, 899--908 (2013; Zbl 1263.05068) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Maddaloni, Alessandro; Simonsen, Sven Quasi-hamiltonian paths in semicomplete multipartite digraphs. (English) Zbl 1262.05095 Discrete Appl. Math. 161, No. 7-8, 889-898 (2013). MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Appl. Math. 161, No. 7--8, 889--898 (2013; Zbl 1262.05095) Full Text: DOI
Adams, Sarah Spence; Howell, Noura; Karst, Nathaniel; Troxell, Denise Sakai; Zhu, Junjie On the \(L(2,1)\)-labelings of amalgamations of graphs. (English) Zbl 1263.05086 Discrete Appl. Math. 161, No. 7-8, 881-888 (2013). MSC: 05C78 05C15 05C76 05C90 PDFBibTeX XMLCite \textit{S. S. Adams} et al., Discrete Appl. Math. 161, No. 7--8, 881--888 (2013; Zbl 1263.05086) Full Text: DOI
Humphries, Peter J.; Linz, Simone; Semple, Charles On the complexity of computing the temporal hybridization number for two phylogenies. (English) Zbl 1318.92038 Discrete Appl. Math. 161, No. 7-8, 871-880 (2013). MSC: 92D15 68Q25 PDFBibTeX XMLCite \textit{P. J. Humphries} et al., Discrete Appl. Math. 161, No. 7--8, 871--880 (2013; Zbl 1318.92038) Full Text: DOI