Partitioning the Edges of a Planar Graph into Two Partial K-Trees
暂无分享,去创建一个
[1] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.
[2] Charles J. Colbourn,et al. On two dual classes of planar graphs , 1990, Discret. Math..
[3] G. Chartrand,et al. Graphs with Forbidden Subgraphs , 1971 .
[4] Frederick Hoffman,et al. [Proceedings of the Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing , 1982 .
[5] S. Arnborg,et al. Characterization and recognition of partial 3-trees , 1986 .
[6] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .
[7] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[8] R. E. Pippert,et al. Properties and characterizations of k -trees , 1971 .
[9] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[10] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.
[11] D. Rose,et al. A Separator Theorem for Chordal Graphs , 1982 .
[12] Charles J. Colbourn,et al. Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.
[13] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .
[14] Stefan Arnborg,et al. Forbidden minors characterization of partial 3-trees , 1990, Discret. Math..
[15] O. H. Lowry. Academic press. , 1972, Analytical chemistry.
[16] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[17] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .
[18] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .