Neighborhood perfect graphs
- 31 August 1986
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 61 (1) , 93-101
- https://doi.org/10.1016/0012-365x(86)90031-2
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984
- Graphs whose neighborhoods have no special cyclesDiscrete Mathematics, 1983
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Khachiyan’s algorithm for linear programmingPublished by Springer Nature ,1981
- Trivially perfect graphsDiscrete Mathematics, 1978
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962