Bichromatic \(P_{4}\)-composition schemes for perfect orderability

DOI10.1016/S0166-218X(03)00367-6zbMath1043.05048MaRDI QIDQ1827860

William J. Lenhart, Ryan B. Hayward

Publication date: 6 August 2004

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

zbMATH Keywords

\(P_4\)-structure\(P_4\)Graph compositionPerfect orderPerfectly orderable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Weakly triangulated graphs
• On the complexity of recognizing a class of perfectly orderable graphs
• On a property of the class of n-colorable graphs
• Two-colourings that decompose perfect graphs
• Which line-graphs are perfectly orderable?
• Doubly Lexical Orderings of Matrices
• On brittle graphs
• Some classes of perfectly orderable graphs
• On the perfect orderability of unions of two graphs
• Reducibility among Combinatorial Problems
• Bull-free weakly chordal perfectly orderable graphs

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