Ghaderpour, Ebrahim Constructions for orthogonal designs using signed group orthogonal designs. (English) Zbl 1372.05026 Discrete Math. 341, No. 1, 277-285 (2018). MSC: 05B15 05B30 05B20 PDF BibTeX XML Cite \textit{E. Ghaderpour}, Discrete Math. 341, No. 1, 277--285 (2018; Zbl 1372.05026) Full Text: DOI
Bustamante, Sebastián; Stein, Maya Monochromatic tree covers and Ramsey numbers for set-coloured graphs. (English) Zbl 1372.05136 Discrete Math. 341, No. 1, 266-276 (2018). MSC: 05C55 05C15 05C05 05C70 PDF BibTeX XML Cite \textit{S. Bustamante} and \textit{M. Stein}, Discrete Math. 341, No. 1, 266--276 (2018; Zbl 1372.05136) Full Text: DOI
Bruner, Ariel; Sharir, Micha Distinct distances between a collinear set and an arbitrary set of points. (English) Zbl 1378.51007 Discrete Math. 341, No. 1, 261-265 (2018). MSC: 51D20 05B25 PDF BibTeX XML Cite \textit{A. Bruner} and \textit{M. Sharir}, Discrete Math. 341, No. 1, 261--265 (2018; Zbl 1378.51007) Full Text: DOI arXiv
Bang, Sejeong Diameter bounds for geometric distance-regular graphs. (English) Zbl 1372.05056 Discrete Math. 341, No. 1, 253-260 (2018). MSC: 05C12 05C50 PDF BibTeX XML Cite \textit{S. Bang}, Discrete Math. 341, No. 1, 253--260 (2018; Zbl 1372.05056) Full Text: DOI
Liu, Haodong; Lu, Hongliang A degree condition for a graph to have \((a,b)\)-parity factors. (English) Zbl 1372.05042 Discrete Math. 341, No. 1, 244-252 (2018). MSC: 05C07 05C70 PDF BibTeX XML Cite \textit{H. Liu} and \textit{H. Lu}, Discrete Math. 341, No. 1, 244--252 (2018; Zbl 1372.05042) Full Text: DOI arXiv
Perrin, Dominique; Reutenauer, Christophe Hall sets, Lazard sets and comma-free codes. (English) Zbl 1409.94850 Discrete Math. 341, No. 1, 232-243 (2018). MSC: 94A45 17B01 94A05 PDF BibTeX XML Cite \textit{D. Perrin} and \textit{C. Reutenauer}, Discrete Math. 341, No. 1, 232--243 (2018; Zbl 1409.94850) Full Text: DOI arXiv
Katona, Gyula Y.; Soltész, Dániel; Varga, Kitti Properties of minimally \(t\)-tough graphs. (English) Zbl 1372.05108 Discrete Math. 341, No. 1, 221-231 (2018). MSC: 05C35 05C60 PDF BibTeX XML Cite \textit{G. Y. Katona} et al., Discrete Math. 341, No. 1, 221--231 (2018; Zbl 1372.05108) Full Text: DOI
Morteza Mirafzal, S. More odd graph theory from another point of view. (English) Zbl 1372.05100 Discrete Math. 341, No. 1, 217-220 (2018). MSC: 05C25 05C76 PDF BibTeX XML Cite \textit{S. Morteza Mirafzal}, Discrete Math. 341, No. 1, 217--220 (2018; Zbl 1372.05100) Full Text: DOI arXiv
Gray, Adam; Reid, Talmage J.; Zhou, Xiangqian Clones in matroids representable over a prime field. (English) Zbl 1372.05029 Discrete Math. 341, No. 1, 213-216 (2018). MSC: 05B35 52B40 PDF BibTeX XML Cite \textit{A. Gray} et al., Discrete Math. 341, No. 1, 213--216 (2018; Zbl 1372.05029) Full Text: DOI
Gould, Ronald J.; Hirohata, Kazuhide; Keller, Ariel On vertex-disjoint cycles and degree sum conditions. (English) Zbl 1372.05111 Discrete Math. 341, No. 1, 203-212 (2018). MSC: 05C38 05C07 05C35 PDF BibTeX XML Cite \textit{R. J. Gould} et al., Discrete Math. 341, No. 1, 203--212 (2018; Zbl 1372.05111) Full Text: DOI
McQuillan, Dan; McQuillan, James M. Strong vertex-magic and edge-magic labelings of 2-regular graphs of odd order using Kotzig completion. (English) Zbl 1372.05191 Discrete Math. 341, No. 1, 194-202 (2018). MSC: 05C78 PDF BibTeX XML Cite \textit{D. McQuillan} and \textit{J. M. McQuillan}, Discrete Math. 341, No. 1, 194--202 (2018; Zbl 1372.05191) Full Text: DOI
Haslegrave, John; Johnson, Richard A. B.; Koch, Sebastian Locating a robber with multiple probes. (English) Zbl 1372.05140 Discrete Math. 341, No. 1, 184-193 (2018). MSC: 05C57 05C40 91A43 91A24 PDF BibTeX XML Cite \textit{J. Haslegrave} et al., Discrete Math. 341, No. 1, 184--193 (2018; Zbl 1372.05140) Full Text: DOI
Barrus, Michael D.; Donovan, Elizabeth A. Neighborhood degree lists of graphs. (English) Zbl 1372.05040 Discrete Math. 341, No. 1, 175-183 (2018). MSC: 05C07 PDF BibTeX XML Cite \textit{M. D. Barrus} and \textit{E. A. Donovan}, Discrete Math. 341, No. 1, 175--183 (2018; Zbl 1372.05040) Full Text: DOI
Brown, Paul; Fenner, Trevor The size of a graph is reconstructible from any \(n-2\) cards. (English) Zbl 1372.05141 Discrete Math. 341, No. 1, 165-174 (2018). MSC: 05C60 05C12 PDF BibTeX XML Cite \textit{P. Brown} and \textit{T. Fenner}, Discrete Math. 341, No. 1, 165--174 (2018; Zbl 1372.05141) Full Text: DOI
Abrishami, Gholamreza; Henning, Michael A. Independent domination in subcubic graphs of girth at least six. (English) Zbl 1372.05154 Discrete Math. 341, No. 1, 155-164 (2018). MSC: 05C69 PDF BibTeX XML Cite \textit{G. Abrishami} and \textit{M. A. Henning}, Discrete Math. 341, No. 1, 155--164 (2018; Zbl 1372.05154) Full Text: DOI
Du, Hui; Faudree, Ralph J.; Lehel, Jenő; Yoshimoto, Kiyoshi A panconnectivity theorem for bipartite graphs. (English) Zbl 1372.05116 Discrete Math. 341, No. 1, 151-154 (2018). MSC: 05C40 PDF BibTeX XML Cite \textit{H. Du} et al., Discrete Math. 341, No. 1, 151--154 (2018; Zbl 1372.05116) Full Text: DOI
Benevides, Fabrício S.; Gerbner, Dániel; Palmer, Cory T.; Vu, Dominik K. Identifying defective sets using queries of small size. (English) Zbl 1372.05146 Discrete Math. 341, No. 1, 143-150 (2018). MSC: 05C65 PDF BibTeX XML Cite \textit{F. S. Benevides} et al., Discrete Math. 341, No. 1, 143--150 (2018; Zbl 1372.05146) Full Text: DOI
Agong, Louis Anthony; Amarra, Carmen; Caughman, John S.; Herman, Ari J.; Terada, Taiyo S. On the girth and diameter of generalized Johnson graphs. (English) Zbl 1372.05054 Discrete Math. 341, No. 1, 138-142 (2018). MSC: 05C12 PDF BibTeX XML Cite \textit{L. A. Agong} et al., Discrete Math. 341, No. 1, 138--142 (2018; Zbl 1372.05054) Full Text: DOI
Hou, Xinmin; Qiu, Yu; Liu, Boyuan Turán number and decomposition number of intersecting odd cycles. (English) Zbl 1372.05171 Discrete Math. 341, No. 1, 126-137 (2018). MSC: 05C70 05C38 05C35 PDF BibTeX XML Cite \textit{X. Hou} et al., Discrete Math. 341, No. 1, 126--137 (2018; Zbl 1372.05171) Full Text: DOI arXiv
Gentner, Michael; Heinrich, Irene; Jäger, Simon; Rautenbach, Dieter Large values of the clustering coefficient. (English) Zbl 1372.05209 Discrete Math. 341, No. 1, 119-125 (2018). MSC: 05C82 PDF BibTeX XML Cite \textit{M. Gentner} et al., Discrete Math. 341, No. 1, 119--125 (2018; Zbl 1372.05209) Full Text: DOI
Wang, Xin; Wei, Hengjia; Ge, Gennian A strengthened inequality of Alon-Babai-Suzuki’s conjecture on set systems with restricted intersections modulo \(p\). (English) Zbl 1372.05227 Discrete Math. 341, No. 1, 109-118 (2018). MSC: 05D05 05A20 PDF BibTeX XML Cite \textit{X. Wang} et al., Discrete Math. 341, No. 1, 109--118 (2018; Zbl 1372.05227) Full Text: DOI arXiv
Tait, Michael Degree Ramsey numbers for even cycles. (English) Zbl 1372.05137 Discrete Math. 341, No. 1, 104-108 (2018). MSC: 05C55 05C38 PDF BibTeX XML Cite \textit{M. Tait}, Discrete Math. 341, No. 1, 104--108 (2018; Zbl 1372.05137) Full Text: DOI arXiv
Kang, Jeong-Hyun A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\). (English) Zbl 1372.05076 Discrete Math. 341, No. 1, 96-103 (2018). MSC: 05C15 PDF BibTeX XML Cite \textit{J.-H. Kang}, Discrete Math. 341, No. 1, 96--103 (2018; Zbl 1372.05076) Full Text: DOI
Huczynska, Sophie; Paterson, Maura B. Existence and non-existence results for strong external difference families. (English) Zbl 1372.05023 Discrete Math. 341, No. 1, 87-95 (2018). MSC: 05B05 05B10 PDF BibTeX XML Cite \textit{S. Huczynska} and \textit{M. B. Paterson}, Discrete Math. 341, No. 1, 87--95 (2018; Zbl 1372.05023) Full Text: DOI arXiv
Wang, Yi; Gong, Shi-Cai; Fan, Yi-Zheng On the determinant of the Laplacian matrix of a complex unit gain graph. (English) Zbl 1372.05097 Discrete Math. 341, No. 1, 81-86 (2018). MSC: 05C22 PDF BibTeX XML Cite \textit{Y. Wang} et al., Discrete Math. 341, No. 1, 81--86 (2018; Zbl 1372.05097) Full Text: DOI
Csajbók, Bence; Zanella, Corrado Maximum scattered \(\mathbb{F}_q\)-linear sets of \(\mathrm{PG}(1,q^4)\). (English) Zbl 1387.51008 Discrete Math. 341, No. 1, 74-80 (2018). Reviewer: Daniele Bartoli (Perugia) MSC: 51E15 05B25 PDF BibTeX XML Cite \textit{B. Csajbók} and \textit{C. Zanella}, Discrete Math. 341, No. 1, 74--80 (2018; Zbl 1387.51008) Full Text: DOI
Wang, L.; Cao, H. A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors. (English) Zbl 1372.05177 Discrete Math. 341, No. 1, 67-73 (2018). MSC: 05C70 05C38 PDF BibTeX XML Cite \textit{L. Wang} and \textit{H. Cao}, Discrete Math. 341, No. 1, 67--73 (2018; Zbl 1372.05177) Full Text: DOI
Clemens, Dennis; Mikalački, Mirjana How fast can maker win in fair biased games? (English) Zbl 1372.05139 Discrete Math. 341, No. 1, 51-66 (2018). MSC: 05C57 91A43 91A24 PDF BibTeX XML Cite \textit{D. Clemens} and \textit{M. Mikalački}, Discrete Math. 341, No. 1, 51--66 (2018; Zbl 1372.05139) Full Text: DOI
Li, Jiaao; Luo, Rong; Wang, Yi Nowhere-zero 3-flow of graphs with small independence number. (English) Zbl 1372.05095 Discrete Math. 341, No. 1, 42-50 (2018). MSC: 05C21 05C40 PDF BibTeX XML Cite \textit{J. Li} et al., Discrete Math. 341, No. 1, 42--50 (2018; Zbl 1372.05095) Full Text: DOI arXiv
Pinheiro, Lucélia Kowalski; Trevisan, Vilmar Maximality of the signless Laplacian energy. (English) Zbl 1372.05130 Discrete Math. 341, No. 1, 33-41 (2018). MSC: 05C50 05C22 05C35 PDF BibTeX XML Cite \textit{L. K. Pinheiro} and \textit{V. Trevisan}, Discrete Math. 341, No. 1, 33--41 (2018; Zbl 1372.05130) Full Text: DOI
Zhang, Dong Topological multiplicity of the maximum eigenvalue of graph \(1\)-Laplacian. (English) Zbl 1372.05133 Discrete Math. 341, No. 1, 25-32 (2018). MSC: 05C50 05C69 PDF BibTeX XML Cite \textit{D. Zhang}, Discrete Math. 341, No. 1, 25--32 (2018; Zbl 1372.05133) Full Text: DOI
Anderson, S. E.; Nagpal, Shriya; Wash, K. Domination in the hierarchical product and Vizing’s conjecture. (English) Zbl 1372.05155 Discrete Math. 341, No. 1, 20-24 (2018). MSC: 05C69 05C76 PDF BibTeX XML Cite \textit{S. E. Anderson} et al., Discrete Math. 341, No. 1, 20--24 (2018; Zbl 1372.05155) Full Text: DOI
Rapke, T. K.; Seyffarth, K. On nice and injective-nice tournaments. (English) Zbl 1372.05090 Discrete Math. 341, No. 1, 1-19 (2018). MSC: 05C20 05C15 05C60 PDF BibTeX XML Cite \textit{T. K. Rapke} and \textit{K. Seyffarth}, Discrete Math. 341, No. 1, 1--19 (2018; Zbl 1372.05090) Full Text: DOI