On the powers of graphs with bounded asteroidal number

DOI10.1016/S0012-365X(00)00043-1zbMath0969.05027WikidataQ126653430 ScholiaQ126653430MaRDI QIDQ1587600

Ting-Yem Ho, Jou-Ming Chang, Yue-Li Wang

Publication date: 3 October 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

strong perfect graph conjectureasteroidal tripleAT-free graphsasteroidal numberasteroidal set

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Perfect graphs (05C17)

Related Items (2)

Interval degree and bandwidth of a graph ⋮ Induced matchings in asteroidal triple-free graphs

This page was built for publication: On the powers of graphs with bounded asteroidal number