On the Existence and Determination of Satisfactory Partitions in a Graph-Reference-Cited by-同舟云学术

On the Existence and Determination of Satisfactory Partitions in a Graph

Published:2003 Issue: Volume: Page:444-453
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Bazgan Cristina,Tuza Zsolt,Vanderpooten Daniel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24587-2_46

Reference5 articles.

1. Bodlaender, H.L.: On disjoint cycles. International Journal of Foundations of Computer Science 5(1), 59–68 (1994)

2. Chvátal, V.: Recognizing decomposable graphs. Journal of Graph Theory 8, 51–53 (1984)

3. Gerber, M., Kobler, D.: Algorithmic approach to the satisfactory graph partitioning problem. European Journal of Operation Research 125, 283–291 (2000)

4. Lovász, L.: Coverings and coloring of hypergraphs. In: Proceedings of 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, pp. 3–12 (1973)

5. Stiebitz, M.: Decomposing graphs under degree constraints. Journal of Graph Theory 23, 321–324 (1996)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Balanced Satisfactory Partition Problem;SOFSEM 2021: Theory and Practice of Computer Science;2021

2. Parameterized Complexity of Satisfactory Partition Problem;Combinatorial Optimization and Applications;2020

3. Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition;Graphs and Combinatorics;2019-11-27

4. Internal Partitions of Regular Graphs;Journal of Graph Theory;2015-08-25

5. Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs;Algorithms and Computation;2014