Graph decomposition with applications to subdivisions and path systems modulo k

Cited in

(34)

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

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)