Advertisement

Computing Small Pivot-Minors

  • Konrad K. Dabrowski
  • François Dross
  • Jisu Jeong
  • Mamadou Moustapha Kanté
  • O-joung Kwon
  • Sang-il Oum
  • Daniël Paulusma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11159)

Abstract

A graph G contains a graph H as a pivot-minor if H can be obtained from G by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. However, so far, pivot-minors have only been studied from a structural perspective. We initiate a systematic study into their complexity aspects. We first prove that the Pivot-Minor problem, which asks if a given graph G contains a given graph H as a pivot-minor, is NP-complete. If H is not part of the input, we denote the problem by H-Pivot-Minor. We give a certifying polynomial-time algorithm for H -Pivot-Minor for every graph H with \(|V(H)|\le 4\) except when \(H \in \{K_4,C_3+ P_1,4P_1\}\), via a structural characterization of H-pivot-minor-free graphs in terms of a set \(\mathcal{F}_H\) of minimal forbidden induced subgraphs.

References

  1. 1.
    Bouchet, A.: Circle graph obstructions. J. Comb. Theory, Ser. B 60(1), 107–144 (1994)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bouchet, A., Duchamp, A.: Representability of \(\Delta \)-matroids over GF(2). Linear Algebra Appl. 146, 67–78 (1991)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Brouwer, A.E., Veldman, H.J.: Contractibility and NP-completeness. J. Graph Theory 11(1), 71–79 (1987)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Corneil, D.G., Lerchs, H., Stewart, L.: Complement reducible graphs. Discrete Appl. Math. 3(3), 163–174 (1981)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Courcelle, B., Oum, S.: Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory, Ser. B 97(1), 91–126 (2007)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Dabrowski, K.K.: Computing small pivot-minors [computer software]. Durham University (2018).  https://doi.org/10.15128/r1t722h881p
  7. 7.
    Dabrowski, K.K., Lozin, V.V., Paulusma, D.: Clique-width and well-quasi-ordering of triangle-free graph classes. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 220–233. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-68705-6_17CrossRefzbMATHGoogle Scholar
  8. 8.
    Dabrowski, K.K., Paulusma, D.: Clique-width of graph classes defined by two forbidden induced subgraphs. Comput. J. 59(5), 650–666 (2016)CrossRefGoogle Scholar
  9. 9.
    Fellows, M.R., Kratochvíl, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica 13(3), 266–282 (1995)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704–714 (1976)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Geelen, J., Gerards, B., Whittle, G.: Towards a structure theory for matrices and matroids. In: Proceedings of ICM 2006, vol. III, no. 827–842 (2006)Google Scholar
  12. 12.
    Geelen, J., Oum, S.: Circle graph obstructions under pivoting. J. Graph Theory 61(1), 1–11 (2009)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Grohe, M., Kawarabayashi, K.-i., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: Proceedings of STOC 2011, pp. 479–488 (2011)Google Scholar
  14. 14.
    Gurski, F.: The behavior of clique-width under graph operations and graph transformations. Theory Comput. Syst. 60(2), 346–376 (2017)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Kamiński, M., Lozin, V.V., Milanič, M.: Recent developments on graphs of bounded clique-width. Discrete Appl. Math. 157(12), 2747–2761 (2009)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Kwon, O., Oum, S.: Graphs of small rank-width are pivot-minors of graphs of small tree-width. Discrete Appl. Math. 168, 108–118 (2014)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Lévêque, B., Lin, D.Y., Maffray, F., Trotignon, N.: Detecting induced subgraphs. Discrete Appl. Math. 157(17), 3540–3551 (2009)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Lévêque, B., Maffray, F., Trotignon, N.: On graphs with no induced subdivision of \(K_4\). J. Comb. Theory Ser. B 102(4), 924–947 (2012)CrossRefGoogle Scholar
  19. 19.
    Matoušek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial \(k\)-trees. Discrete Math. 108(1–3), 343–364 (1992)MathSciNetCrossRefGoogle Scholar
  20. 20.
    McConnell, R.M., Mehlhorn, K., Näher, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5(2), 119–161 (2011)CrossRefGoogle Scholar
  21. 21.
    Olariu, S.: Paw-free graphs. Inf. Process. Lett. 28(1), 53–54 (1988)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Oum, S.: Rank-width and vertex-minors. J. Comb. Theory Ser. B 95(1), 79–100 (2005)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Oum, S.: Rank-width and well-quasi-ordering. SIAM J. Discrete Math. 22(2), 666–682 (2008)MathSciNetCrossRefGoogle Scholar
  24. 24.
    Oum, S.: Excluding a bipartite circle graph from line graphs. J. Graph Theory 60(3), 183–203 (2009)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Oum, S.: Rank-width: algorithmic and structural results. Discrete Appl. Math. 231, 15–24 (2017)MathSciNetCrossRefGoogle Scholar
  26. 26.
    Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theory Ser. B 96(4), 514–528 (2006)MathSciNetCrossRefGoogle Scholar
  27. 27.
    Oxley, J.G.: Matroid Theory. Oxford Graduate Texts in Mathematics, vol. 21, Second edn. Oxford University Press, Oxford (2011)Google Scholar
  28. 28.
    Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65–110 (1995)MathSciNetCrossRefGoogle Scholar
  29. 29.
    van’t Hof, P., Kamiński, M., Paulusma, D., Szeider, S., Thilikos, D.M.: On graph contractions and induced minors. Discrete Appl. Math. 160(6), 799–809 (2012)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceDurham UniversityDurhamUK
  2. 2.LIRMM, CNRS, Université de MontpellierMontpellierFrance
  3. 3.Department of Mathematical SciencesKAISTDaejeonSouth Korea
  4. 4.Université Clermont Auvergne, LIMOS, CNRSAubièreFrance
  5. 5.Department of MathematicsIncheon National UniversityIncheonSouth Korea

Personalised recommendations