Author:
Bujtás Csilla,Sampathkumar E.,Tuza Zsolt,Pushpalatha L.,Vasundhara R.C.
Funder
Department of Science and Technology, Government of India
Hungarian Scientific Research Fund
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. On the existence and determination of satisfactory partitions in a graph;Bazgan,2003
2. Efficient algorithms for decomposing graphs under degree constraints;Bazgan;Discrete Applied Mathematics,2007
3. Satisfactory graph partition, variants, and generalizations;Bazgan;European Journal of Operational Research,2010
4. The complexity of the matching-cut problem for planar graphs and other graph classes;Bonsma;Journal of Graph Theory,2009
5. Matching cutsets in graphs of diameter 2;Borowiecki;Theoretical Computer Science,2008
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献