On the perfect orderability of unions of two graphs

DOI10.1002/(SICI)1097-0118(200001)33:1%3C32::AID-JGT4%3E3.0.CO;2-YMaRDI QIDQ4944684zbMATH OpenOpenAlexFDO

Authors Xiaodan Tu, Chính T. Hoàng

Publication date 10 September 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(200001)33:1%3C32::aid-jgt4%3E3.0.co;2-y

zbMATH Keywords

greedy algorithmthreshold graphperfectly orderablesequential colouring algorithm

Mathematics Subject Classification ID

Perfect graphs (05C17)

Recommendations

• A note on perfectly orderable graphs
• Perfectly orderable graphs: A survey
• Some classes of perfectly orderable graphs
• scientific article; zbMATH DE number 3221981
• New classes of perfectly orderable graphs
• New properties of perfectly orderable graphs and strongly perfect graphs
• On a conjecture of Hoàng and Tu concerning perfectly orderable graphs
• Perfectly orderable graphs and unique colorability
• On ordered graphs and graph orderings
• On the complexity of recognizing a class of perfectly orderable graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• A note on perfectly orderable graphs
• Four classes of perfectly orderable graphs
• On randomized stopping points and perfect graphs
• Quasi-brittle graphs, a new class of perfectly orderable graphs
• Tolerance graphs
• Topics on perfect graphs
• Weakly triangulated graphs
• \(P_ 4\)-comparability graphs

Cited in

(3)

• Perfectly orderable graphs and unique colorability
• On a conjecture of Hoàng and Tu concerning perfectly orderable graphs
• Bichromatic \(P_{4}\)-composition schemes for perfect orderability

This page was built for publication: On the perfect orderability of unions of two graphs

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