Graph decomposition with applications to subdivisions and path systems modulo k

DOI10.1002/JGT.3190070215MaRDI QIDQ3661617zbMATH OpenOpenAlexFDO

Authors Carsten Thomassen

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

zbMATH Keywords

chromatic numberminimum degreepath systems with prescribed endssubdivisions of complete bipartite graphsthree set decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Graph theory (05C99)

Cited in

(38)

• Pendant tree-connectivity
• Even cycles in directed graphs
• Graph decomposition with constraints in the minimum degree
• Cycles of length 0 modulo 4 in graphs
• Partitions of graphs with high minimum degree or connectivity.
• Cycle lengths and minimum degree of graphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Cycles of given lengths in hypergraphs
• Covering a graph by topological complete subgraphs
• Contractible subgraphs in 3-connected graphs
• Cycle lengths in expanding graphs
• Cycle lengths modulo k in expanders
• Gaps in the cycle spectrum of 3-connected cubic planar graphs
• Extremal infinite graph theory
• Decomposing graphs into paths of fixed length
• On the odd-minor variant of Hadwiger's conjecture
• Induced paths in 5-connected graphs
• Cycles of even lengths modulo k
• Nonseparating cycles avoiding specific vertices
• Cycle lengths modulo \(k\) in large 3-connected cubic graphs
• On Modulo Linked Graphs
• scientific article; zbMATH DE number 2230314 (Why is no real title available?)
• Divisible subdivisions
• Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two
• Highly Connected Subgraphs with Large Chromatic Number
• Subdivisions with congruence constraints in digraphs of large chromatic number
• Tight bounds for divisible subdivisions
• 4-Chromatic graphs have at least four cycles of length 0 mod 3
• Subdivisions in dicritical digraphs with large order or digirth
• On graphs without cycles of length 0 modulo 4
• Packing subdivisions into regular graphs
• Cycle lengths in graphs of given minimum degree
• Group vertex-arboricity of group-labelled graphs
• The Kelmans-Seymour conjecture. IV: A proof
• Girth in graphs
• Cycles with consecutive odd lengths
• Linked graphs with restricted lengths
• A weaker version of Lovász' path removal conjecture

This page was built for publication: Graph decomposition with applications to subdivisions and path systems modulo k

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661617)