Separating subgraphs in k-trees: Cables and caterpillars
暂无分享,去创建一个
The class of k-trees has the property that the minimal sets of vertices separating two nonadjacent vertices u and v of a k-tree Q induce k-complete subgraphs. We show that the union T of these subgraphs belongs to a subclass of (k - 1)-trees which generalizes caterpillars. The maximum order of a monochromatic set of vertices in the optimal coloring of this (k - 1)-tree T determines the length of the minimal collection of k vertex-disjoint paths between the two vertices of Q, the u, v-cable, which is spanned on all vertices of T.
[1] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .
[2] Donald J. ROSE,et al. On simple characterizations of k-trees , 1974, Discret. Math..
[3] Andrzej Proskurowski. Recursive Graphs, Recursive Labelings and Shortest Paths , 1981, SIAM J. Comput..
[4] R. E. Pippert,et al. Properties and characterizations of k -trees , 1971 .
[5] Frank Harary,et al. Trees with Hamiltonian square , 1971 .