Bichromatic P₄-composition schemes for perfect orderability

DOI10.1016/S0166-218X(03)00367-6MaRDI QIDQ1827860zbMATH OpenFDO

Authors Ryan Hayward, William Lenhart

Publication date 6 August 2004

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

Full work available at URL https://doi.org/10.1016/S0166-218X(03)00367-6

zbMATH Keywords

\(P_4\)\(P_4\)-structureGraph compositionPerfect orderPerfectly orderable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Perfectly orderable P₄ composition
• scientific article; zbMATH DE number 3887730
• \(P_ 4\)-comparability graphs
• A note on strong perfectness of graphs
• Two-colourings that decompose perfect graphs

Cites work

• Bull-free weakly chordal perfectly orderable graphs
• Doubly Lexical Orderings of Matrices
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 1455118 (Why is no real title available?)
• On a property of the class of n-colorable graphs
• On brittle graphs
• On the complexity of recognizing a class of perfectly orderable graphs
• On the perfect orderability of unions of two graphs
• Reducibility among combinatorial problems
• Some classes of perfectly orderable graphs
• Two-colourings that decompose perfect graphs
• Weakly triangulated graphs
• Which line-graphs are perfectly orderable?

Cited in

(1)

• Perfectly orderable P₄ composition

This page was built for publication: Bichromatic \(P_{4}\)-composition schemes for perfect orderability

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