scientific article; zbMATH DE number 2104729

zbMATH Open1061.05072MaRDI QIDQ4820779FDOQ4820779

Authors: Michael U. Gerber, Daniel Kobler 

Publication date: 1 October 2004

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1933255
• The balanced satisfactory partition problem
• The satisfactory partition problem
• Satisfactory graph partition, variants, and generalizations
• Algorithms and Computation

zbMATH Keywords

line graphspartitionable graphsatisfactory graph partitioning problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cited In (29)

• The satisfactory partition problem
• Stabilization Time in Weighted Minority Processes
• On partitions of graphs under degree constraints
• The balanced satisfactory partition problem
• Algorithms and Computation
• Degree-constrained 2-partitions of graphs
• On a conjecture of Schweser and Stiebitz
• Title not available (Why is that?)
• On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
• Partitions of graphs and multigraphs under degree constraints
• Very cost effective bipartitions in graphs
• Graph partitions under average degree constraint
• Parameterized complexity of satisfactory partition problem
• On connected partition with degree constraints
• Min-max communities in graphs: complexity and computational properties
• On some open problems concerning quorum colorings of graphs
• Efficient algorithms for decomposing graphs under degree constraints
• Satisfactory graph partition, variants, and generalizations
• Title not available (Why is that?)
• Bounds on cost effective domination numbers
• Partitions of multigraphs without \(C_4\)
• Partitions of multigraphs under minimum degree constraints
• Degree-constrained decompositions of graphs: Bounded treewidth and planarity
• Algorithmic approach to the satisfactory graph partitioning problem
• Alliances and Related Domination Parameters
• Bipartition of graph under degree constraints
• 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)