On the complexity of recognizing perfectly orderable graphs

  • Authors:
  • M. Middendorf;F. Pfeiffer

  • Affiliations:
  • -;-

  • Venue:
  • Discrete Mathematics
  • Year:
  • 1990

Quantified Score

Hi-index 0.06

Visualization

Abstract