Partition of graphs with condition on the connectivity and minimum degree
From MaRDI portal
Publication:787160
DOI10.1007/BF02579344zbMath0529.05030MaRDI QIDQ787160
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Related Items (23)
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 ⋮ On connected partition with degree constraints ⋮ Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths ⋮ Degree-constrained 2-partitions of graphs ⋮ Partitions of graphs with high minimum degree or connectivity. ⋮ Sparse Spanning $k$-Connected Subgraphs in Tournaments ⋮ Non-separating subgraphs in highly connected graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Path partitions and \(P_{n}\)-free sets ⋮ What is on his mind? ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Bipartition of graph under degree constraints ⋮ Partitions of multigraphs without \(C_4\) ⋮ Covering a graph by topological complete subgraphs ⋮ Partitioning a graph into alliance free sets ⋮ A Relaxed Version of the Erdős–Lovász Tihany Conjecture ⋮ Nested cycles with no geometric crossings
Cites Work
This page was built for publication: Partition of graphs with condition on the connectivity and minimum degree
