Graph decomposition with applications to subdivisions and path systems modulo k
From MaRDI portal
Publication:3661617
DOI10.1002/jgt.3190070215zbMath0515.05052OpenAlexW1980214165MaRDI QIDQ3661617
Publication date: 1983
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190070215
chromatic numberminimum degreepath systems with prescribed endssubdivisions of complete bipartite graphsthree set decomposition
Related Items (33)
Even cycles in directed graphs ⋮ Bipartitions of highly connected tournaments ⋮ Graph decomposition with constraints in the minimum degree ⋮ Nonseparating Cycles Avoiding Specific Vertices ⋮ On Modulo Linked Graphs ⋮ Induced paths in 5-connected graphs ⋮ Cycle lengths and minimum degree of graphs ⋮ Divisible subdivisions ⋮ Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two ⋮ Cycles with consecutive odd lengths ⋮ Highly Connected Subgraphs with Large Chromatic Number ⋮ Partitions of graphs with high minimum degree or connectivity. ⋮ Subdivisions with congruence constraints in digraphs of large chromatic number ⋮ Tight bounds for divisible subdivisions ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Decomposing graphs into paths of fixed length ⋮ Gaps in the cycle spectrum of 3-connected cubic planar graphs ⋮ Linked graphs with restricted lengths ⋮ A weaker version of Lovász' path removal conjecture ⋮ Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics ⋮ Extremal infinite graph theory ⋮ Cycles of given lengths in hypergraphs ⋮ Cycle lengths in expanding graphs ⋮ Cycles of even lengths modulo k ⋮ On the odd-minor variant of Hadwiger's conjecture ⋮ Covering a graph by topological complete subgraphs ⋮ Unnamed Item ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Girth in graphs ⋮ Contractible subgraphs in 3-connected graphs ⋮ Pendant tree-connectivity ⋮ Cycles of length 0 modulo 4 in graphs ⋮ Cycle lengths modulo \(k\) in expanders
This page was built for publication: Graph decomposition with applications to subdivisions and path systems modulo k
