On the perfect orderability of unions of two graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(200001)33:1<32::AID-JGT4>3.0.CO;2-Y" /><32::AID-JGT4>3.0.CO;2-Y 10.1002/(SICI)1097-0118(200001)33:1<32::AID-JGT4>3.0.CO;2-YzbMath0943.05039OpenAlexW4236734648MaRDI QIDQ4944684

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<32::aid-jgt4>3.0.co;2-y

zbMATH Keywords

greedy algorithmperfectly orderablethreshold graphsequential colouring algorithm

Mathematics Subject Classification ID

Perfect graphs (05C17)

Related Items (2)

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

Cites Work

• Unnamed Item
• Topics on perfect graphs
• Tolerance graphs
• Weakly triangulated graphs
• On randomized stopping points and perfect graphs
• \(P_ 4\)-comparability graphs
• A note on perfectly orderable graphs
• Quasi-brittle graphs, a new class of perfectly orderable graphs
• Four classes of perfectly orderable graphs

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