具有小弦度的图的Hadwiger数
Hadwiger number of graphs with small chordality
摘要:
图G的Hadwiger数是使得G有完全图Kh作为子图的最大整数h。我们证明了确定图的Hadwiger数的问题在余二部图上是NP-困难的,但在余图和二部置换图上可以在多项式时间内解决。我们还考虑了这个问题的一个自然推广,要求最大的整数h,使G有一个小的h顶点和直径至多$s$。我们证明了当s>=2时,这个问题在AT-free图上可以在多项式时间内得到解决,但对于任何固定的s>=2,这个问题在弦图上是NP-困难的。
英文摘要:
The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph is NP-hard on co-bipartite graphs, but can be solved in polynomial time on cographs and on bipartite permutation graphs. We also consider a natural generalization of this problem that asks for the largest integer h such that G has a minor with h vertices and diameter at most $s$. We show that this problem can be solved in polynomial time on AT-free graphs when s>=2, but is NP-hard on chordal graphs for every fixed s>=2.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。