Permutation Graphs: Connected Domination and Steiner Trees

This publication has 12 references indexed in Scilit:

• Domination in permutation graphs
  Journal of Algorithms, 1985
• On the Algorithmic Complexity of Total Domination
  SIAM Journal on Algebraic Discrete Methods, 1984
• Clustering and domination in perfect graphs
  Discrete Applied Mathematics, 1984
• Domination, independent domination, and duality in strongly chordal graphs
  Discrete Applied Mathematics, 1984
• A linear algorithm for the domination number of a series-parallel graph
  Discrete Applied Mathematics, 1983
• Transitive orientation in 0(n²) time
  Published by Association for Computing Machinery (ACM) ,1983
• Independent domination in chordal graphs
  Operations Research Letters, 1982
• Dominating Sets in Chordal Graphs
  SIAM Journal on Computing, 1982
• Complement reducible graphs
  Discrete Applied Mathematics, 1981
• Transitive Orientation of Graphs and Identification of Permutation Graphs
  Canadian Journal of Mathematics, 1971