Kawarabayashi, Ken-ichi; Plummer, Michael D. Bounding the size of equimatchable graphs of fixed genus. (English) Zbl 1191.05033 Graphs Comb. 25, No. 1, 91-99 (2009). Reviewer: Arthur T. White (Kalamazoo) MSC: 05C10 05C70 PDF BibTeX XML Cite \textit{K.-i. Kawarabayashi} and \textit{M. D. Plummer}, Graphs Comb. 25, No. 1, 91--99 (2009; Zbl 1191.05033) Full Text: DOI OpenURL
Imrich, Wilfried; Klavžar, Sandi Transitive, locally finite median graphs with finite blocks. (English) Zbl 1194.05133 Graphs Comb. 25, No. 1, 81-90 (2009). MSC: 05C75 05C63 05C12 PDF BibTeX XML Cite \textit{W. Imrich} and \textit{S. Klavžar}, Graphs Comb. 25, No. 1, 81--90 (2009; Zbl 1194.05133) Full Text: DOI OpenURL
Zhen, Lingyan; Wu, Baoyindureng List point arboricity of dense graphs. (English) Zbl 1188.05083 Graphs Comb. 25, No. 1, 123-128 (2009). MSC: 05C42 05C15 05C35 05C78 PDF BibTeX XML Cite \textit{L. Zhen} and \textit{B. Wu}, Graphs Comb. 25, No. 1, 123--128 (2009; Zbl 1188.05083) Full Text: DOI OpenURL
Benini, Anna; Pasotti, Anita On the existence of elementary Abelian cycle systems. (English) Zbl 1200.05046 Graphs Comb. 25, No. 1, 1-14 (2009). Reviewer: Peter Boyvalenkov (Sofia) MSC: 05B30 PDF BibTeX XML Cite \textit{A. Benini} and \textit{A. Pasotti}, Graphs Comb. 25, No. 1, 1--14 (2009; Zbl 1200.05046) Full Text: DOI Link OpenURL
Omidi, G. R. On the nullity of bipartite graphs. (English) Zbl 1194.05092 Graphs Comb. 25, No. 1, 111-114 (2009). MSC: 05C50 PDF BibTeX XML Cite \textit{G. R. Omidi}, Graphs Comb. 25, No. 1, 111--114 (2009; Zbl 1194.05092) Full Text: DOI OpenURL
Favaron, O.; Karami, H.; Khoeilar, R.; Sheikholeslami, S. M. A new bound on the total domination subdivision number. (English) Zbl 1211.05109 Graphs Comb. 25, No. 1, 41-47 (2009). MSC: 05C69 PDF BibTeX XML Cite \textit{O. Favaron} et al., Graphs Comb. 25, No. 1, 41--47 (2009; Zbl 1211.05109) Full Text: DOI OpenURL
Hiraki, Akira Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\). (English) Zbl 1207.05223 Graphs Comb. 25, No. 1, 65-79 (2009). MSC: 05E30 05C12 PDF BibTeX XML Cite \textit{A. Hiraki}, Graphs Comb. 25, No. 1, 65--79 (2009; Zbl 1207.05223) Full Text: DOI OpenURL
Brier, Robert; Bryant, Darryn Perpendicular rectangular Latin arrays. (English) Zbl 1186.05032 Graphs Comb. 25, No. 1, 15-25 (2009). Reviewer: Dan S. Archdeacon (Burlington) MSC: 05B15 PDF BibTeX XML Cite \textit{R. Brier} and \textit{D. Bryant}, Graphs Comb. 25, No. 1, 15--25 (2009; Zbl 1186.05032) Full Text: DOI OpenURL
Mansour, Toufik; Song, Chunwei; Yuster, Raphael A comment on Ryser’s conjecture for intersecting hypergraphs. (English) Zbl 1211.05094 Graphs Comb. 25, No. 1, 101-109 (2009). MSC: 05C65 05D05 05C75 PDF BibTeX XML Cite \textit{T. Mansour} et al., Graphs Comb. 25, No. 1, 101--109 (2009; Zbl 1211.05094) Full Text: DOI arXiv OpenURL
Shewale, R. S.; Joshi, Vinayak; Kharat, V. S. Frankl’s conjecture and the dual covering property. (English) Zbl 1202.06001 Graphs Comb. 25, No. 1, 115-121 (2009). Reviewer: Ivan Chajda (Přerov) MSC: 06A06 05D05 PDF BibTeX XML Cite \textit{R. S. Shewale} et al., Graphs Comb. 25, No. 1, 115--121 (2009; Zbl 1202.06001) Full Text: DOI OpenURL
Forbes, A. D.; Grannell, M. J.; Griggs, T. S. Further 6-sparse Steiner triple systems. (English) Zbl 1188.05034 Graphs Comb. 25, No. 1, 49-64 (2009). Reviewer: Peter Horák (Tacoma) MSC: 05B07 PDF BibTeX XML Cite \textit{A. D. Forbes} et al., Graphs Comb. 25, No. 1, 49--64 (2009; Zbl 1188.05034) Full Text: DOI Link OpenURL
Chen, An-Hang; Chang, Jou-Ming; Wang, Yue-Li The interchange graphs of tournaments with minimum score vectors are exactly hypercubes. (English) Zbl 1207.05068 Graphs Comb. 25, No. 1, 27-34 (2009). MSC: 05C20 PDF BibTeX XML Cite \textit{A.-H. Chen} et al., Graphs Comb. 25, No. 1, 27--34 (2009; Zbl 1207.05068) Full Text: DOI OpenURL
Cranston, Daniel W. Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable. (English) Zbl 1221.05133 Graphs Comb. 25, No. 1, 35-40 (2009). MSC: 05C15 PDF BibTeX XML Cite \textit{D. W. Cranston}, Graphs Comb. 25, No. 1, 35--40 (2009; Zbl 1221.05133) Full Text: DOI arXiv OpenURL