Graph decomposition with constraints on the connectivity and minimum degree

Cited In (42)

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

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)