Maximum Directed Cuts in Graphs with Degree Constraints

ISSN： 0911-0119

Source： Graphs and Combinatorics, Vol.28, Iss.4, 2012-07, pp. : 563-574

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

Triangulating Planar Graphs While Minimizing the Maximum Degree

By Kant G. Bodlaender H.L.

Information and Computation, Vol. 135, Iss. 1, 1997-05 ,pp. : 1-14

Academic Press

Access to resources Recommend Favorite

On the size of critical graphs with small maximum degree

By Miao Lian-Ying Song Wen-Yao Pang Shi-You Miao Zheng-Ke

International Journal of Computer Mathematics, Vol. 91, Iss. 10, 2014-10 ,pp. : 2142-2151

Taylor & Francis Ltd

Access to resources Recommend Favorite

Sparse H-Colourable Graphs of Bounded Maximum Degree

By Hajiabolhassan Hossein Zhu Xuding

Graphs and Combinatorics, Vol. 20, Iss. 1, 2004-03 ,pp. : 65-71

Springer Publishing Company

Access to resources Recommend Favorite

Multiway cuts in node weighted graphs

By Garg N. Vazirani V.V. Yannakakis M.

Journal of Algorithms, Vol. 50, Iss. 1, 2004-01 ,pp. : 49-61

Elsevier

Access to resources Recommend Favorite

Metric dimension of directed graphs

By Rajan Bharati Rajasingh Indra Cynthia Jude Annie Manuel Paul

International Journal of Computer Mathematics, Vol. 91, Iss. 7, 2014-07 ,pp. : 1397-1406

Taylor & Francis Ltd

Access to resources Recommend Favorite