论文信息 - The Geodetic Hull Number is Hard for Chordal Graphs - 字舞流文

The Geodetic Hull Number is Hard for Chordal Graphs

We show the hardness of the geodetic hull number for chordal graphs.

Dieter Rautenbach | Mitre Costa Dourado | Stéphane Bessy | Lucia Draque Penso

[1] Martin G. Everett,et al. The hull number of a graph , 1985, Discret. Math..

[2] Jayme Luiz Szwarcfiter,et al. On the Hull Number of Triangle-Free Graphs , 2010, SIAM J. Discret. Math..

[3] Júlio Araújo,et al. Hull number: P5-free graphs and reduction rules , 2016, Discret. Appl. Math..

[4] Dieter Rautenbach,et al. On the geodetic hull number of Pk-free graphs , 2016, Theor. Comput. Sci..

[5] Frédéric Giroire,et al. On the hull number of some graph classes , 2011, Electron. Notes Discret. Math..

[6] Lhouari Nourine,et al. Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs , 2016, SIAM J. Discret. Math..

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Kolja B. Knauer,et al. Convexity in partial cubes: The hull number , 2013, Discret. Math..

[9] Júlio Araújo,et al. Hull number: P5-free graphs and reduction rules , 2013, Electron. Notes Discret. Math..

[10] Jayme Luiz Szwarcfiter,et al. On the computation of the hull number of a graph , 2009, Discret. Math..

[11] RautenbachDieter,et al. On the geodetic hull number of Pk-free graphs , 2016 .

[12] Lhouari Nourine,et al. Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs , 2013, SIAM J. Discret. Math..