Partition of graphs with condition on the connectivity and minimum degree
From MaRDI portal
(Redirected from Publication:787160)
Cites work
Cited in
(23)- On partitions of graphs under degree constraints
- Partitioning a graph into highly connected subgraphs
- Nested cycles with no geometric crossings
- Finding good 2-partitions of digraphs. I. Hereditary properties
- A relaxed version of the Erdős-Lovász Tihany conjecture
- Path partitions and \(P_{n}\)-free sets
- Degree-constrained 2-partitions of graphs
- Partitioning graphs with linear minimum degree
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Partitions of graphs with high minimum degree or connectivity.
- 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
- Non-separating subgraphs in highly connected graphs
- Partitions of multigraphs without \(C_4\)
- What is on his mind?
- Covering a graph by topological complete subgraphs
- On 1-factors with prescribed lengths in tournaments
- Graph factors and factorization: 1985--2003: a survey
- Bipartition of graph under degree constraints
- Sparse spanning \(k\)-connected subgraphs in tournaments
- Finding good 2-partitions of digraphs. II. Enumerable properties
- Graph decomposition with constraints in the minimum degree
This page was built for publication: Partition of graphs with condition 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 Q787160)
