On line perfect graphs

DOI10.1007/BF01609025zbMath0384.05058OpenAlexW2068993429WikidataQ56388867 ScholiaQ56388867MaRDI QIDQ4163266

Dominique de Werra

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01609025

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (5)

Almost nonpreemptive schedules ⋮ Bicolored matchings in some classes of graphs ⋮ Bicolored matchings in some classes of graphs ⋮ Mutual exclusion scheduling with interval graphs or related classes. II ⋮ Partial characterizations of coordinated graphs: Line graphs and complements of forests

Cites Work

• Normal hypergraphs and the perfect graph conjecture
• Line perfect graphs

This page was built for publication: On line perfect graphs