scientific article; zbMATH DE number 2104729
From MaRDI portal
Recommendations
Cited in
(29)- The satisfactory partition problem
- Stabilization Time in Weighted Minority Processes
- The balanced satisfactory partition problem
- On partitions of graphs under degree constraints
- Algorithms and Computation
- Degree-constrained 2-partitions of graphs
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
- On a conjecture of Schweser and Stiebitz
- scientific article; zbMATH DE number 1933255 (Why is no real title available?)
- Very cost effective bipartitions in graphs
- Partitions of graphs and multigraphs under degree constraints
- Graph partitions under average degree constraint
- Min-max communities in graphs: complexity and computational properties
- On connected partition with degree constraints
- Efficient algorithms for decomposing graphs under degree constraints
- On some open problems concerning quorum colorings of graphs
- Parameterized complexity of satisfactory partition problem
- Satisfactory graph partition, variants, and generalizations
- Partitions of multigraphs without \(C_4\)
- scientific article; zbMATH DE number 2227473 (Why is no real title available?)
- Bounds on cost effective domination numbers
- Partitions of multigraphs under minimum degree constraints
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity
- Algorithmic approach to the satisfactory graph partitioning problem
- Bipartition of graph under degree constraints
- Alliances and Related Domination Parameters
- Asymptotically almost every \(2r\)-regular graph has an internal partition
- A note on internal partitions: the 5-regular case and beyond
- A note on the satisfactory partition problem: constant size requirement
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820779)
