Wang, Shiying; Zhao, Nana Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected. (English) Zbl 1311.05179 Discrete Appl. Math. 184, 258-263 (2015). MSC: 05C82 05C40 PDF BibTeX XML Cite \textit{S. Wang} and \textit{N. Zhao}, Discrete Appl. Math. 184, 258--263 (2015; Zbl 1311.05179) Full Text: DOI
Surmacs, Michel Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments. (English) Zbl 1311.05093 Discrete Appl. Math. 184, 253-257 (2015). MSC: 05C38 05C20 05C45 PDF BibTeX XML Cite \textit{M. Surmacs}, Discrete Appl. Math. 184, 253--257 (2015; Zbl 1311.05093) Full Text: DOI
Shigeta, Manami; Amano, Kazuyuki Ordered biclique partitions and communication complexity problems. (English) Zbl 1311.05167 Discrete Appl. Math. 184, 248-252 (2015). MSC: 05C70 05C69 PDF BibTeX XML Cite \textit{M. Shigeta} and \textit{K. Amano}, Discrete Appl. Math. 184, 248--252 (2015; Zbl 1311.05167) Full Text: DOI arXiv
Jing, Yubo; Wang, Yingqian (3, 1)-choosability of toroidal graphs with some forbidden short cycles. (English) Zbl 1311.05091 Discrete Appl. Math. 184, 243-247 (2015). MSC: 05C38 05C10 PDF BibTeX XML Cite \textit{Y. Jing} and \textit{Y. Wang}, Discrete Appl. Math. 184, 243--247 (2015; Zbl 1311.05091) Full Text: DOI
Janczewski, Robert; Turowski, Krzysztof The computational complexity of the backbone coloring problem for planar graphs with connected backbones. (English) Zbl 1311.05065 Discrete Appl. Math. 184, 237-242 (2015). MSC: 05C15 05C10 68Q17 PDF BibTeX XML Cite \textit{R. Janczewski} and \textit{K. Turowski}, Discrete Appl. Math. 184, 237--242 (2015; Zbl 1311.05065) Full Text: DOI
Ghorbani, Modjtaba; Azimi, Nasrin Characterization of split graphs with at most four distinct eigenvalues. (English) Zbl 1311.05112 Discrete Appl. Math. 184, 231-236 (2015). MSC: 05C50 05C31 PDF BibTeX XML Cite \textit{M. Ghorbani} and \textit{N. Azimi}, Discrete Appl. Math. 184, 231--236 (2015; Zbl 1311.05112) Full Text: DOI
Furuya, Michitaka A note on total domination and 2-rainbow domination in graphs. (English) Zbl 1311.05148 Discrete Appl. Math. 184, 229-230 (2015). MSC: 05C69 PDF BibTeX XML Cite \textit{M. Furuya}, Discrete Appl. Math. 184, 229--230 (2015; Zbl 1311.05148) Full Text: DOI
Dankelmann, Peter Proximity, remoteness and minimum degree. (English) Zbl 1311.05048 Discrete Appl. Math. 184, 223-228 (2015). MSC: 05C12 05C07 05C35 PDF BibTeX XML Cite \textit{P. Dankelmann}, Discrete Appl. Math. 184, 223--228 (2015; Zbl 1311.05048) Full Text: DOI
Wu, Baofeng; Lin, Dongdai On constructing complete permutation polynomials over finite fields of even characteristic. (English) Zbl 1311.05009 Discrete Appl. Math. 184, 213-222 (2015). MSC: 11T06 PDF BibTeX XML Cite \textit{B. Wu} and \textit{D. Lin}, Discrete Appl. Math. 184, 213--222 (2015; Zbl 1311.05009) Full Text: DOI arXiv
Sedlar, Jelena; Stevanović, Dragan; Vasilyev, Alexander On the inverse sum indeg index. (English) Zbl 1311.05201 Discrete Appl. Math. 184, 202-212 (2015). MSC: 05C90 PDF BibTeX XML Cite \textit{J. Sedlar} et al., Discrete Appl. Math. 184, 202--212 (2015; Zbl 1311.05201) Full Text: DOI
Palacios, José Luis On the Kirchhoff index of graphs with diameter 2. (English) Zbl 1311.05056 Discrete Appl. Math. 184, 196-201 (2015). MSC: 05C12 05C82 05C90 PDF BibTeX XML Cite \textit{J. L. Palacios}, Discrete Appl. Math. 184, 196--201 (2015; Zbl 1311.05056) Full Text: DOI
Luiz, Atílio G.; Campos, C. N.; de Mello, C. P. AVD-total-colouring of complete equipartite graphs. (English) Zbl 1310.05096 Discrete Appl. Math. 184, 189-195 (2015). MSC: 05C15 PDF BibTeX XML Cite \textit{A. G. Luiz} et al., Discrete Appl. Math. 184, 189--195 (2015; Zbl 1310.05096) Full Text: DOI
Kraft, Benjamin Diameters of Cayley graphs generated by transposition trees. (English) Zbl 1311.05082 Discrete Appl. Math. 184, 178-188 (2015). MSC: 05C25 05C12 05C05 05C85 PDF BibTeX XML Cite \textit{B. Kraft}, Discrete Appl. Math. 184, 178--188 (2015; Zbl 1311.05082) Full Text: DOI
Henning, Michael A.; Marcon, Sinclair A. Domination versus disjunctive domination in trees. (English) Zbl 1311.05149 Discrete Appl. Math. 184, 171-177 (2015). MSC: 05C69 05C05 PDF BibTeX XML Cite \textit{M. A. Henning} and \textit{S. A. Marcon}, Discrete Appl. Math. 184, 171--177 (2015; Zbl 1311.05149) Full Text: DOI
Gui, Hao; Wang, Weifan; Wang, Yiqiao; Zhang, Zhao Equitable total-coloring of subcubic graphs. (English) Zbl 1311.05063 Discrete Appl. Math. 184, 167-170 (2015). MSC: 05C15 PDF BibTeX XML Cite \textit{H. Gui} et al., Discrete Appl. Math. 184, 167--170 (2015; Zbl 1311.05063) Full Text: DOI
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia Approximate tradeoffs on weighted labeled matroids. (English) Zbl 1311.05028 Discrete Appl. Math. 184, 154-166 (2015). MSC: 05B35 05C22 PDF BibTeX XML Cite \textit{L. Gourvès} et al., Discrete Appl. Math. 184, 154--166 (2015; Zbl 1311.05028) Full Text: DOI
Gagarin, Andrei; Zverovich, Vadim The probabilistic approach to limited packings in graphs. (English) Zbl 1310.05171 Discrete Appl. Math. 184, 146-153 (2015). MSC: 05C70 05C85 68W20 PDF BibTeX XML Cite \textit{A. Gagarin} and \textit{V. Zverovich}, Discrete Appl. Math. 184, 146--153 (2015; Zbl 1310.05171) Full Text: DOI arXiv
Fujita, Shinya; Nakamigawa, Tomoki; Sakuma, Tadashi Pebble exchange on graphs. (English) Zbl 1311.05125 Discrete Appl. Math. 184, 139-145 (2015). MSC: 05C57 91A43 00A08 PDF BibTeX XML Cite \textit{S. Fujita} et al., Discrete Appl. Math. 184, 139--145 (2015; Zbl 1311.05125) Full Text: DOI
Friedrich, Tobias; Krohmer, Anton Parameterized clique on inhomogeneous random graphs. (English) Zbl 1311.05130 Discrete Appl. Math. 184, 130-138 (2015). MSC: 05C60 05C80 PDF BibTeX XML Cite \textit{T. Friedrich} and \textit{A. Krohmer}, Discrete Appl. Math. 184, 130--138 (2015; Zbl 1311.05130) Full Text: DOI
Fouquet, Jean-Luc; Maffray, Frédéric Domination, coloring and stability in \(P_5\)-reducible graphs. (English) Zbl 1408.05097 Discrete Appl. Math. 184, 122-129 (2015). MSC: 05C69 05C15 05C85 PDF BibTeX XML Cite \textit{J.-L. Fouquet} and \textit{F. Maffray}, Discrete Appl. Math. 184, 122--129 (2015; Zbl 1408.05097) Full Text: DOI
Safina Devi, N.; Mane, Aniket C.; Mishra, Sounaka Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs. (English) Zbl 1311.05088 Discrete Appl. Math. 184, 114-121 (2015). MSC: 05C35 05C75 68W25 PDF BibTeX XML Cite \textit{N. Safina Devi} et al., Discrete Appl. Math. 184, 114--121 (2015; Zbl 1311.05088) Full Text: DOI
Cooper, Martin C.; Escamocher, Guillaume Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns. (English) Zbl 1311.05004 Discrete Appl. Math. 184, 89-113 (2015). MSC: 05A05 68T20 PDF BibTeX XML Cite \textit{M. C. Cooper} and \textit{G. Escamocher}, Discrete Appl. Math. 184, 89--113 (2015; Zbl 1311.05004) Full Text: DOI
Busbait, Monther; Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail Diagnosis of constant faults in read-once contact networks over finite bases. (English) Zbl 1311.05176 Discrete Appl. Math. 184, 76-88 (2015). MSC: 05C82 06E30 PDF BibTeX XML Cite \textit{M. Busbait} et al., Discrete Appl. Math. 184, 76--88 (2015; Zbl 1311.05176) Full Text: DOI
Bianchi, Monica; Cornaro, Alessandra; Palacios, José Luis; Torriero, Anna New bounds of degree-based topological indices for some classes of \(c\)-cyclic graphs. (English) Zbl 1311.05035 Discrete Appl. Math. 184, 62-75 (2015). MSC: 05C07 05C35 PDF BibTeX XML Cite \textit{M. Bianchi} et al., Discrete Appl. Math. 184, 62--75 (2015; Zbl 1311.05035) Full Text: DOI arXiv
Berry, Anne; Brandstädt, Andreas; Giakoumakis, Vassilis; Maffray, Frédéric Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. (English) Zbl 1311.05182 Discrete Appl. Math. 184, 50-61 (2015). MSC: 05C85 05C60 PDF BibTeX XML Cite \textit{A. Berry} et al., Discrete Appl. Math. 184, 50--61 (2015; Zbl 1311.05182) Full Text: DOI
Aravind, N. R.; Kalyanasundaram, Subrahmanyam; Sandeep, R. B.; Sivadasan, Naveen The chromatic discrepancy of graphs. (English) Zbl 1311.05057 Discrete Appl. Math. 184, 40-49 (2015). MSC: 05C15 05C80 68Q17 PDF BibTeX XML Cite \textit{N. R. Aravind} et al., Discrete Appl. Math. 184, 40--49 (2015; Zbl 1311.05057) Full Text: DOI arXiv
Alahmadi, A.; Aldred, R. E. L.; de la Cruz, R.; Ok, S.; Solé, P.; Thomassen, C. The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes. (English) Zbl 1311.05027 Discrete Appl. Math. 184, 32-39 (2015). MSC: 05B35 94B25 PDF BibTeX XML Cite \textit{A. Alahmadi} et al., Discrete Appl. Math. 184, 32--39 (2015; Zbl 1311.05027) Full Text: DOI
Jäger, Gerold; Peczarski, Marcin The worst case number of questions in generalized AB game with and without white-peg answers. (English) Zbl 1312.91004 Discrete Appl. Math. 184, 20-31 (2015). MSC: 91A05 91A46 PDF BibTeX XML Cite \textit{G. Jäger} and \textit{M. Peczarski}, Discrete Appl. Math. 184, 20--31 (2015; Zbl 1312.91004) Full Text: DOI
Costa, Vitor; Dantas, Simone; Rautenbach, Dieter Asymptotic surviving rate of trees with multiple fire sources. (English) Zbl 1311.05124 Discrete Appl. Math. 184, 14-19 (2015). MSC: 05C57 05C05 91A43 PDF BibTeX XML Cite \textit{V. Costa} et al., Discrete Appl. Math. 184, 14--19 (2015; Zbl 1311.05124) Full Text: DOI
Béal, Sylvain; Rémila, Eric; Solal, Philippe A decomposition of the space of TU-games using addition and transfer invariance. (English) Zbl 1311.91013 Discrete Appl. Math. 184, 1-13 (2015). MSC: 91A12 91A70 PDF BibTeX XML Cite \textit{S. Béal} et al., Discrete Appl. Math. 184, 1--13 (2015; Zbl 1311.91013) Full Text: DOI