Quasi-brittle graphs, a new class of perfectly orderable graphs

DOI10.1016/0012-365X(93)90513-SMaRDI QIDQ2366016zbMATH OpenFDO

Authors Stephan Olariu

Publication date 29 June 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(93)90513-S

zbMATH Keywords

brittle graphsperfectly orderable graphsquasi-brittle graphs

Mathematics Subject Classification ID

Graph theory (05C99) Ordered structures (06F99)

Recommendations

• New classes of perfectly orderable graphs
• On brittle graphs
• New properties of perfectly orderable graphs and strongly perfect graphs
• Perfectly orderable graphs: A survey

Cites work

• A New Class of Brittle Graphs
• A note on superbrittle graphs
• scientific article; zbMATH DE number 3891425 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• On brittle graphs
• On the complexity of recognizing perfectly orderable graphs
• Topics on perfect graphs
• Weak bipolarizable graphs

Cited in

(9)

• Perfectly orderable graphs are quasi-parity graphs: a short proof
• Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
• \(P_{4}\)-laden graphs: A new class of brittle graphs
• Recognition of some perfectly orderable graph classes
• Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
• A New Class of Brittle Graphs
• On brittle graphs
• On the perfect orderability of unions of two graphs
• New classes of perfectly orderable graphs

This page was built for publication: Quasi-brittle graphs, a new class of perfectly orderable graphs

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