On the powers of graphs with bounded asteroidal number

DOI10.1016/S0012-365X(00)00043-1zbMATH Open0969.05027WikidataQ126653430 ScholiaQ126653430MaRDI QIDQ1587600FDOQ1587600

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

Publication date: 3 October 2001

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

Recommendations

• scientific article; zbMATH DE number 2191988
• scientific article; zbMATH DE number 165077
• scientific article; zbMATH DE number 1107735
• On the structure of graphs with bounded asteroidal number
• Graph classes with and without powers of bounded clique-width

zbMATH Keywords

AT-free graphsasteroidal triplestrong perfect graph conjectureasteroidal setasteroidal number

Mathematics Subject Classification ID

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

Cited In (6)

• A novel discussion on power fuzzy graphs and their application in decision making
• On asteroidal sets in chordal graphs
• Title not available (Why is that?)
• Interval degree and bandwidth of a graph
• Induced matchings in asteroidal triple-free graphs
• On regular power fuzzy graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587600)