Xu, Guangjun 2-rainbow domination in generalized petersen graphs \(P(n,3)\). (English) Zbl 1209.05175 Discrete Appl. Math. 157, No. 11, 2570-2573 (2009). MSC: 05C69 × Cite Format Result Cite Review PDF Full Text: DOI
Salem, Khaled; Klavžar, Sandi; Vesel, Aleksander; Žigert, Petra The Clar formulas of a benzenoid system and the resonance graph. (English) Zbl 1211.05173 Discrete Appl. Math. 157, No. 11, 2565-2569 (2009). MSC: 05C90 92E10 × Cite Format Result Cite Review PDF Full Text: DOI
Rukhin, Andrey; Priebe, Carey E.; Healy, Dennis M. jun. On the monotone likelihood ratio property for the convolution of independent binomial random variables. (English) Zbl 1211.60007 Discrete Appl. Math. 157, No. 11, 2562-2564 (2009). MSC: 60E05 × Cite Format Result Cite Review PDF Full Text: DOI
Kozawa, Kyohei; Otachi, Yota; Yamazaki, Koichi Security number of grid-like graphs. (English) Zbl 1211.05118 Discrete Appl. Math. 157, No. 11, 2555-2561 (2009). MSC: 05C69 × Cite Format Result Cite Review PDF Full Text: DOI
Kosowski, Adrian A note on the strength and minimum color sum of bipartite graphs. (English) Zbl 1211.05042 Discrete Appl. Math. 157, No. 11, 2552-2554 (2009). MSC: 05C15 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
Currie, James; Rampersad, Narad There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\). (English) Zbl 1211.05006 Discrete Appl. Math. 157, No. 11, 2548-2551 (2009). MSC: 05A05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Berbeglia, Gerardo; Hahn, Geňa Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #\(P\)-complete. (English) Zbl 1185.90168 Discrete Appl. Math. 157, No. 11, 2541-2547 (2009). MSC: 90C27 90C60 × Cite Format Result Cite Review PDF Full Text: DOI
Bang-Jensen, Jørgen \(k\)-strong spanning local tournaments in locally semicomplete digraphs. (English) Zbl 1211.05050 Discrete Appl. Math. 157, No. 11, 2536-2540 (2009). MSC: 05C20 × Cite Format Result Cite Review PDF Full Text: DOI
Apollonio, N.; Franciosa, P. G. On the complexity of recognizing directed path families. (English) Zbl 1211.05049 Discrete Appl. Math. 157, No. 11, 2525-2535 (2009). MSC: 05C20 05C65 05C85 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Andrén, Daniel; Markström, Klas The bivariate Ising polynomial of a graph. (English) Zbl 1211.05059 Discrete Appl. Math. 157, No. 11, 2515-2524 (2009). MSC: 05C31 82B20 × Cite Format Result Cite Review PDF Full Text: DOI