Algorithmic graph theory and perfect graphs

1986/06/01 by Rolf H. Möhring · 9 citations
Computer Science · #Advanced Graph Theory Research #Digital Image Processing Techniques #Graph Labeling and Dimension Problems

paper · doi:10.1007/bf00390110

crossref issued 1986/06/01 · crossref published 1986/06/01 · crossref published-print 1986/06/01 · openalex publication_date 1986/06/01 · crossref created 2006/02/20 · crossref deposited 2019/04/17 · openalex created_date 2025/10/10 · crossref indexed 2026/03/12 · openalex updated_date 2026/07/23

Cited by

• A unified approach to approximating resource allocation and scheduling
• Simultaneous separation in bounded degree trees
• Mixed Unit Interval Bigraphs : A Characterization
• Concurrency Constrained Scheduling with Tree-Like Constraints
• On the structure of (dart, odd hole)-free graphs
• Characterization of Split Comparability Graphs
• Lower bounds on collective additive spanners
• Maximum Edge Open Packing in Permutation, Interval, and Well-Partitioned Chordal Graphs
• Martin Charles Golumbic [wikipedia]