Graph decomposition with constraints on the connectivity and minimum degree

Cited in

(41)

On partitions of \(K_{2, 3}\)-free graphs under degree constraints
Approximation of satisfactory bisection problems
Partitioning graphs with linear minimum degree
Bipartition of graph under degree constraints
Graph factors and factorization: 1985--2003: a survey
Finding good 2-partitions of digraphs. I. Hereditary properties
On partitions of graphs under degree constraints
The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
A generalization of Stiebitz-type results on graph decomposition
Partitions of multigraphs under minimum degree constraints
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
Graph decomposition with constraints in the minimum degree
Degree-constrained 2-partitions of graphs
Asymptotically almost every \(2r\)-regular graph has an internal partition
Friendly bisections of random graphs
Partitions of multigraphs without \(C_4\)
Partitioning a graph into alliance free sets
Non-separating subgraphs in highly connected graphs
Decomposition of graphs with constraint on minimum degree
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
Partitions of graphs and multigraphs under degree constraints
Tournaments and Semicomplete Digraphs
On connected partition with degree constraints
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
On a conjecture of Schweser and Stiebitz
A note on partitions of graphs under degree constraints
Partition of graphs with condition on the connectivity and minimum degree
Graphical decompositions
Satisfactory graph partition, variants, and generalizations
Finding good 2-partitions of digraphs. II. Enumerable properties
Partitioning a graph into highly connected subgraphs
On 1-factors with prescribed lengths in tournaments
A relaxed version of the Erdős-Lovász Tihany conjecture
Nested cycles with no geometric crossings
Partitions of graphs with high minimum degree or connectivity.
Graph partitioning: an updated survey
Sparse spanning \(k\)-connected subgraphs in tournaments
Path partitions and \(P_{n}\)-free sets
Internal partitions of regular graphs
Graph partitions under average degree constraint
A note on internal partitions: the 5-regular case and beyond

This page was built for publication: Graph decomposition with constraints on the connectivity and minimum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661610)