Partition of graphs with condition on the connectivity and minimum degree
From MaRDI portal
Publication:787160
DOI10.1007/BF02579344zbMATH Open0529.05030MaRDI QIDQ787160FDOQ787160
Authors: Péter Hajnal 
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
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
- A relaxed version of the Erdős-Lovász Tihany conjecture
- Finding good 2-partitions of digraphs. I. Hereditary properties
- 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
- Partitions of multigraphs without \(C_4\)
- Non-separating subgraphs in highly connected graphs
- What is on his mind?
- Covering a graph by topological complete subgraphs
- On 1-factors with prescribed lengths in tournaments
- Sparse spanning \(k\)-connected subgraphs 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
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)
