Excluding a group-labelled graph
From MaRDI portal
Publication:2519025
DOI10.1016/J.JCTB.2008.07.003zbMath1226.05213OpenAlexW1989224319MaRDI QIDQ2519025
Publication date: 21 January 2009
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/13254
Related Items (6)
A Faster Parameterized Algorithm for Group Feedback Edge Set ⋮ When does a biased graph come from a group labelling? ⋮ 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 ⋮ Space Complexity of Reachability Testing in Labelled Graphs ⋮ Space complexity of reachability testing in labelled graphs
Cites Work
- Graph minors. XX: Wagner's conjecture
- Biased graphs. I: Bias, balance, and gains
- Packing non-zero \(A\)-paths in group-labelled graphs
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- Biased graphs. II: The three matroids
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XVI: Excluding a non-planar graph
- Graph minors. XIII: The disjoint paths problem
- On the odd-minor variant of Hadwiger's conjecture
This page was built for publication: Excluding a group-labelled graph