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

DOI10.1016/0012-365X(93)90513-SzbMath0771.05093MaRDI QIDQ2366016

Stephan Olariu

Publication date: 29 June 1993

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

zbMATH Keywords

perfectly orderable graphsquasi-brittle graphsbrittle graphs

Mathematics Subject Classification ID

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

Related Items (2)

On the perfect orderability of unions of two graphs ⋮ Recognition of some perfectly orderable graph classes

Cites Work

• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• On the complexity of recognizing perfectly orderable graphs
• A note on superbrittle graphs
• Weak bipolarizable graphs
• A New Class of Brittle Graphs
• On brittle graphs

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