Packing A-paths of length zero modulo a prime
From MaRDI portal
Packing \(A\)-paths of length zero modulo a prime
Recommendations
Cites work
- \(k\)-blocks: a connectivity invariant for graphs
- A Historical Note
- A new upper bound for the bipartite Ramsey problem
- A unified Erdős-Pósa theorem for constrained cycles
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XIII: The disjoint paths problem
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- On Independent Circuits Contained in a Graph
- Packing \(A\)-paths of length zero modulo four
- Packing cycles in undirected group-labelled graphs
- Packing non-zero A-paths in an undirected model of group labeled graphs
- Packing non-zero \(A\)-paths in group-labelled graphs
- Quickly excluding a planar graph
- Über die Maximalzahl kreuzungsfreier H-Wege
Cited in
(6)- Packing \(A\)-paths of length zero modulo four
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Packing cycles in undirected group-labelled graphs
- A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
- Packing A-paths of length zero modulo a prime
- Group vertex-arboricity of group-labelled graphs
This page was built for publication: Packing \(A\)-paths of length zero modulo a prime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692782)