On a Problem Concerning k-Subdomination Numbers of Graphs

ISSN： 0011-4642

Source： Czechoslovak Mathematical Journal, Vol.53, Iss.3, 2003-09, pp. : 627-629

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Algorithms for the maximum k-club problem in graphs

By Shahinpour Shahram Butenko Sergiy

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 520-554

Springer Publishing Company

Access to resources Recommend Favorite

The p-maxian problem on block graphs

By Kang Liying Cheng Yukun

Journal of Combinatorial Optimization, Vol. 20, Iss. 2, 2010-08 ,pp. : 131-141

Springer Publishing Company

Access to resources Recommend Favorite

Blocks in k-connected graphs

By Karpov D.

Journal of Mathematical Sciences, Vol. 126, Iss. 3, 2005-03 ,pp. : 1167-1181

Springer Publishing Company

Access to resources Recommend Favorite

Necessary Edges in k-Chordalisations of Graphs

By Bodlaender Hans L.

Journal of Combinatorial Optimization, Vol. 7, Iss. 3, 2003-09 ,pp. : 283-290

Springer Publishing Company

Access to resources Recommend Favorite

k-Dependence and Domination in Kings Graphs

By Ionascu Eugen J. Pritikin Dan Wright Stephen E.

American Mathematical Monthly, Vol. 115, Iss. 9, 2008-11 ,pp. : 820-836

Mathematical Association of America

Access to resources Recommend Favorite