scientific article; zbMATH DE number 944226
From MaRDI portal
DOI<321::AID-JGT12>3.0.CO;2-H 10.1002/(SICI)1097-0118(199611)23:3<321::AID-JGT12>3.0.CO;2-HzbMath0865.05058MaRDI QIDQ4715286
Publication date: 7 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On partitions of graphs under degree constraints, Degree-constrained decompositions of graphs: Bounded treewidth and planarity, Vertex-disjoint subgraphs with high degree sums, Some remarks on even-hole-free graphs, The extremal function for disconnected minors, Minors in graphs of large \(\theta_r\)-girth, Decomposition of graphs with constraint on minimum degree, On a conjecture of Schweser and Stiebitz, On some open problems concerning quorum colorings of graphs, The path partition conjecture is true for claw-free graphs, On connected partition with degree constraints, Efficient algorithms for decomposing graphs under degree constraints, Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs, Partitions of graphs and multigraphs under degree constraints, Disjoint cycles of different lengths in graphs and digraphs, Degree-constrained 2-partitions of graphs, Friendly bisections of random graphs, Decomposing edge-colored graphs under color degree constraints, Weak internal partition of regular graphs, A note on partitions of graphs under degree constraints, Graph partitioning: an updated survey, A note on internal partitions: the 5-regular case and beyond, On the existence of vertex-disjoint subgraphs with high degree sum, Min-max communities in graphs: complexity and computational properties, Partitions of graphs with high minimum degree or connectivity., Improper C-colorings of graphs, Unnamed Item, Graph partitions under average degree constraint, Non-separating subgraphs in highly connected graphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Partition and disjoint cycles in digraphs, Partitions of multigraphs under minimum degree constraints, On splitting digraphs, A note on a cycle partition problem, Path partitions and \(P_{n}\)-free sets, Satisfactory graph partition, variants, and generalizations, What is on his mind?, The satisfactory partition problem, Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization, On 1-factors with prescribed lengths in tournaments, A generalization of Stiebitz-type results on graph decomposition, Complexity and kernels for bipartition into degree-bounded induced graphs, Bipartition of graph under degree constraints, On partitions of \(K_{2, 3}\)-free graphs under degree constraints, Partitions of multigraphs without \(C_4\), Asymptotically almost every \(2r\)-regular graph has an internal partition, Internal Partitions of Regular Graphs, Partitioning a graph into alliance free sets, Unnamed Item, A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH, A note on the satisfactory partition problem: constant size requirement, The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes], Almost-spanning subgraphs with bounded degree in dense graphs, A Relaxed Version of the Erdős–Lovász Tihany Conjecture, (Dis)assortative partitions on random regular graphs, Nested cycles with no geometric crossings
