On the SPANNING k-Tree Problem

@article{Cai1993OnTS,
  title={On the SPANNING k-Tree Problem},
  author={Leizhen Cai and Fr{\'e}d{\'e}ric Maffray},
  journal={Discrete Applied Mathematics},
  year={1993},
  volume={44},
  pages={139-156}
}
Cai, L. and F. Maffray, On the SPANNING k-TREE problem, Discrete Applied Mathematics 44 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

A dynamic-programming approach to the domination-set problem on k-trees

  • D. G. Corneil, J. M. Keil
  • SIAM J. Algebraic Discrete Methods
  • 1987

Complexity of finding embeddings in a k-tree

  • S. Arnborg, D. G. Corneil, A. Proskurowski
  • SIAM J. Algebraic Discrete Methods
  • 1987

Network design problems: Steiner trees and spanning k-trees

  • M. W. Bern
  • PhD thesis,
  • 1987
2 Excerpts

Data Structures and Network Algorithms

  • R. E. Tarjan
  • (SIAM, Philadelphia,
  • 1983

Extremal graphs with no disconnecting independent vertex set or matching

  • A. M. Farley, A. Proskurowski
  • Tech. Rept. CIS-TR-80.21, Computer and…
  • 1980

Split graphs having Dilworth number two, Canad

  • S. Foldes, P. L. Hammer
  • J. Math
  • 1977

Similar Papers

Loading similar papers…