Contracting bipartite graphs to paths and cycles
From MaRDI portal
Publication:5915810
DOI10.1016/j.endm.2017.06.053zbMath1378.05195arXiv1706.03750OpenAlexW2751182543MaRDI QIDQ5915810
Daniël Paulusma, Konrad K. Dabrowski
Publication date: 18 January 2018
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.03750
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Detecting induced minors in AT-free graphs
- On graph contractions and induced minors
- Partitioning graphs into connected parts
- The complexity of induced minors and related problems
- Graph minors. XIII: The disjoint paths problem
- Detecting fixed patterns in chordal graphs in polynomial time
- Connecting Terminals and 2-Disjoint Connected Subgraphs
- Contractions of Planar Graphs in Polynomial Time
- Contractibility and NP-completeness
- Cyclicity of graphs
- Contracting chordal graphs and bipartite graphs to paths and trees