scientific article; zbMATH DE number 2104729
From MaRDI portal
Publication:4820779
zbMath1061.05072MaRDI QIDQ4820779
Michael U. Gerber, Daniel Kobler
Publication date: 1 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items
On partitions of graphs under degree constraints, The balanced satisfactory partition problem, Degree-constrained decompositions of graphs: Bounded treewidth and planarity, Very cost effective bipartitions in graphs, On a conjecture of Schweser and Stiebitz, On some open problems concerning quorum colorings of graphs, On connected partition with degree constraints, Efficient algorithms for decomposing graphs under degree constraints, Partitions of graphs and multigraphs under degree constraints, Degree-constrained 2-partitions of graphs, A note on internal partitions: the 5-regular case and beyond, Min-max communities in graphs: complexity and computational properties, Graph partitions under average degree constraint, On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities, Partitions of multigraphs under minimum degree constraints, Satisfactory graph partition, variants, and generalizations, The satisfactory partition problem, Bipartition of graph under degree constraints, Parameterized complexity of satisfactory partition problem, Alliances and Related Domination Parameters, Partitions of multigraphs without \(C_4\), Asymptotically almost every \(2r\)-regular graph has an internal partition, Stabilization Time in Weighted Minority Processes, Bounds on cost effective domination numbers, A note on the satisfactory partition problem: constant size requirement
