Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Contracting bipartite graphs to paths and cycles.

Dabrowski, K.K. and Paulusma, D. (2017) 'Contracting bipartite graphs to paths and cycles.', Electronic notes in discrete mathematics., 61 . pp. 309-315.

Abstract

Testing if a given graph G contains the k-vertex path Pk as a minor or as an induced minor is trivial for every fixed integer k≥1. The situation changes for the problem of checking if a graph can be modified into Pk by using only edge contractions. In this case the problem is known to be NP-complete even if k=4. This led to an intensive investigation for testing contractibility on restricted graph classes. We focus on bipartite graphs. Heggernes, van 't Hof, Lévêque and Paul proved that the problem stays NP-complete for bipartite graphs if k=6. We strengthen their result from k=6 to k=5. We also show that the problem of contracting a bipartite graph to the 6-vertex cycle C6 is NP-complete. The cyclicity of a graph is the length of the longest cycle the graph can be contracted to. As a consequence of our second result, determining the cyclicity of a bipartite graph is NP-hard.

Item Type:Article
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF
(101Kb)
Status:Peer-reviewed
Publisher Web site:https://doi.org/10.1016/j.endm.2017.06.053
Publisher statement:© 2017 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Date accepted:29 April 2017
Date deposited:01 June 2017
Date of first online publication:03 August 2017
Date first made open access:03 February 2019

Save or Share this output

Export:
Export
Look up in GoogleScholar