Graph decomposition with constraints on the connectivity and minimum degree
From MaRDI portal
Publication:3661610
DOI10.1002/jgt.3190070204zbMath0515.05045OpenAlexW2079854871MaRDI QIDQ3661610
Publication date: 1983
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190070204
Related Items (41)
On partitions of graphs under degree constraints ⋮ Finding good 2-partitions of digraphs. I. Hereditary properties ⋮ Finding good 2-partitions of digraphs. II. Enumerable properties ⋮ Bipartitions of highly connected tournaments ⋮ Graph decomposition with constraints in the minimum degree ⋮ Partitioning a Graph into Highly Connected Subgraphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Decomposition of graphs with constraint on minimum degree ⋮ On a conjecture of Schweser and Stiebitz ⋮ On connected partition with degree constraints ⋮ Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths ⋮ Partitions of graphs and multigraphs under degree constraints ⋮ Degree-constrained 2-partitions of graphs ⋮ Friendly bisections of random 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 ⋮ Partitions of graphs with high minimum degree or connectivity. ⋮ Sparse Spanning $k$-Connected Subgraphs in Tournaments ⋮ 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 ⋮ Approximation of satisfactory bisection problems ⋮ Partitions of multigraphs under minimum degree constraints ⋮ Path partitions and \(P_{n}\)-free sets ⋮ Satisfactory graph partition, variants, and generalizations ⋮ 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 ⋮ 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 ⋮ Partition of graphs with condition on the connectivity and minimum degree ⋮ Tournaments and Semicomplete Digraphs ⋮ The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes] ⋮ Graphical decompositions ⋮ A Relaxed Version of the Erdős–Lovász Tihany Conjecture ⋮ Nested cycles with no geometric crossings
This page was built for publication: Graph decomposition with constraints on the connectivity and minimum degree
