A note on perfectly orderable graphs
type: Item
instance of: scholarly article
title: A note on perfectly orderable graphs
zbMATH Open document ID: 0858.05095
DOI: 10.1016/0166-218X(95)00042-P
author: Chính T. Hoàng
published in: Discrete Applied Mathematics
publication date: 1997-03-31T00:00:00Z
review text: A graph \(G\) is called a \(D\)-graph if each of its induced subgraphs contains a vertex \(x\) such that, for any edge \(yz\) with \(y\), \(z\) not neighbours of \(x\), \(y\) dominates \(z\) or vice versa, which means \(N(y)-\{z\}\subseteq N(z)\). Here the author proves that each \(D\)-graph is perfectly orderable.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 897388
zbMATH Keywords: perfectly orderable graphs
reviewed by: Michael Hager
MaRDI profile type: Publication
cites work: Characterizations of totally balanced matrices
cites work: Q3879274
cites work: Q3347930
cites work: Which claw-free graphs are perfectly orderable?
cites work: Four classes of perfectly orderable graphs
cites work: On rigid circuit graphs
cites work: Characterizations of strongly chordal graphs
cites work: Q3328583
cites work: A charming class of perfectly orderable graphs
cites work: New properties of perfectly orderable graphs and strongly perfect graphs
cites work: A note on perfect orders
cites work: Totally-Balanced and Greedy Matrices
cites work: Doubly Lexical Orderings of Matrices
cites work: Q4407446
cites work: On the complexity of recognizing perfectly orderable graphs
full work available at URL: 0166-218x(95)00042-p
OpenAlex ID: W1977997947
description: scientific article; zbMATH DE number 897388