Domination problems on P₅-free graphs∗

E-ISSN： 1290-385x|48|5|541-549

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.48, Iss.5, 2015-01, pp. : 541-549

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

Generalization of the total outer-connected domination in graphs

By Rad Nader Jafari Volkmann Lutz

RAIRO - Operations Research, Vol. 50, Iss. 2, 2016-03 ,pp. : 233-239

Edp Sciences

Access to resources Recommend Favorite

An introduction to the twin signed total k-domination numbers in directed graphs

By Atapour Masoud Dehgardi Nasrin Volkmann L.

RAIRO - Operations Research, Vol. 51, Iss. 4, 2017-11 ,pp. : 1331-1343

Edp Sciences

Access to resources Recommend Favorite

Hamiltonicity in Partly claw-free graphs

By Abbas Moncef Benmeziane Zineb

RAIRO - Operations Research, Vol. 43, Iss. 1, 2009-01 ,pp. : 103-113

Edp Sciences

Access to resources Recommend Favorite

Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic∗

By Laforest Christian Phan Raksmey

RAIRO - Operations Research, Vol. 47, Iss. 3, 2013-05 ,pp. : 199-221

Edp Sciences

Access to resources Recommend Favorite

A note on the hardness results for the labeledperfect matching problems in bipartite graphs

By Monnot Jérôme

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 315-324

Edp Sciences

Access to resources Recommend Favorite