Graph decomposition with applications to subdivisions and path systems modulo k

Cited In (35)

Gaps in the cycle spectrum of 3-connected cubic planar graphs
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
Cycle lengths modulo \(k\) in expanders
4-Chromatic graphs have at least four cycles of length 0 mod 3
A weaker version of Lovász' path removal conjecture
Nonseparating Cycles Avoiding Specific Vertices
Girth in graphs
Even cycles in directed graphs
Subdivisions in dicritical digraphs with large order or digirth
Cycles of even lengths modulo k
Title not available (Why is that?)
Subdivisions with congruence constraints in digraphs of large chromatic number
Bipartitions of highly connected tournaments
Tight bounds for divisible subdivisions
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
Partitions of graphs with high minimum degree or connectivity.
Induced paths in 5-connected graphs
Cycles of length 0 modulo 4 in graphs
Cycle lengths in expanding graphs
Extremal infinite graph theory
On the odd-minor variant of Hadwiger's conjecture
The Kelmans-Seymour conjecture. IV: A proof
Contractible subgraphs in 3-connected graphs
Pendant tree-connectivity
Covering a graph by topological complete subgraphs
Divisible subdivisions
Graph decomposition with constraints in the minimum degree
Linked graphs with restricted lengths
On Modulo Linked Graphs
Cycle lengths and minimum degree of graphs
Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics
Cycles with consecutive odd lengths
Cycles of given lengths in hypergraphs
Decomposing graphs into paths of fixed length

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)