Graph decomposition with applications to subdivisions and path systems modulo k

Cited in

(34)

Decomposing graphs into paths of fixed length
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
Cycle lengths modulo \(k\) in expanders
Highly Connected Subgraphs with Large Chromatic Number
Cycles of even lengths modulo \(k\)
4-Chromatic graphs have at least four cycles of length 0 mod 3
A weaker version of Lovász' path removal conjecture
Girth in graphs
Even cycles in directed graphs
Cycle lengths modulo \(k\) in large 3-connected cubic graphs
Subdivisions in dicritical digraphs with large order or digirth
scientific article; zbMATH DE number 2230314 (Why is no real title available?)
Subdivisions with congruence constraints in digraphs of large chromatic number
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
Partitions of graphs with high minimum degree or connectivity.
Tight bounds for divisible subdivisions
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
Covering a graph by topological complete subgraphs
Pendant tree-connectivity
Graph decomposition with constraints in the minimum degree
Nonseparating cycles avoiding specific vertices
Linked graphs with restricted lengths
Divisible subdivisions
Cycle lengths and minimum degree of graphs
On Modulo Linked Graphs
Cycles with consecutive odd lengths
Cycles of given lengths in hypergraphs

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)