Contracting bipartite graphs to paths and cycles
暂无分享,去创建一个
[1] Dorothee Jane Blum. Circularity of graphs , 1982 .
[2] Andries E. Brouwer,et al. Contractibility and NP-completeness , 1987, J. Graph Theory.
[3] Richard H. Hammack. Cyclicity of graphs , 1999 .
[4] Pim van 't Hof,et al. On graph contractions and induced minors , 2012, Discret. Appl. Math..
[5] Petr A. Golovach,et al. Detecting Fixed Patterns in Chordal Graphs in Polynomial Time , 2013, Algorithmica.
[6] Michael R. Fellows,et al. The complexity of induced minors and related problems , 1995, Algorithmica.
[7] Jan Arne Telle,et al. Connecting Terminals and 2-Disjoint Connected Subgraphs , 2013, WG.
[8] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[9] Pim van 't Hof,et al. Contracting chordal graphs and bipartite graphs to paths and trees , 2014, Discret. Appl. Math..
[10] Richard Hammack. A note on the complexity of computing cyclicity , 2002, Ars Comb..
[11] Daniël Paulusma,et al. Contracting Bipartite Graphs to Paths and Cycles , 2017, Electron. Notes Discret. Math..
[12] Jirí Fiala,et al. A note on contracting claw-free graphs , 2013, Discret. Math. Theor. Comput. Sci..
[13] Petr A. Golovach,et al. Detecting induced minors in AT-free graphs , 2013, Theor. Comput. Sci..
[14] Daniël Paulusma,et al. Contractions of Planar Graphs in Polynomial Time , 2010, ESA.