\(P_ 4\)-comparability graphs

DOI10.1016/0012-365X(89)90209-4zbMath0675.05067OpenAlexW1963780543WikidataQ126551949 ScholiaQ126551949MaRDI QIDQ1121924

Bruce A. Reed, Chính T. Hoàng

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90209-4

zbMATH Keywords

perfect graphsperfectly orderable graphscomparability graphsrecognition algorithmclique problemcolouring problems\(P_ 4\)-comparability graphs

Mathematics Subject Classification ID

Partial orders, general (06A06) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (9)

Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs ⋮ On the complexity of recognizing a class of perfectly orderable graphs ⋮ On the perfect orderability of unions of two graphs ⋮ A characterization of \(P_{4}\)-comparability graphs ⋮ On the complexity of recognizing perfectly orderable graphs ⋮ On the \(P_4\)-components of graphs ⋮ Which claw-free graphs are perfectly orderable? ⋮ Recognition of some perfectly orderable graph classes ⋮ Even and odd pairs in comparability and in \(P_4\)-comparability graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bipolarizable graphs
• Some classes of perfectly orderable graphs
• Decomposition of Directed Graphs
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: \(P_ 4\)-comparability graphs