Algorithms for unipolar and generalized split graphs
Authors:
- Elaine M. EschenEEElaine M. Eschen
- Xiaoqiang WangXWXiaoqiang Wang
- 1 January 2014
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 162, 195-201
Abstract
No abstract availableAll Related Versions
This publication has 28 references indexed in Scilit:
- Polar permutation graphs are polynomial-time recognisableEuropean Journal of Combinatorics, 2012
- Polarity of chordal graphsDiscrete Applied Mathematics, 2008
- A wide-range algorithm for minimal triangulation from an arbitrary orderingJournal of Algorithms, 2006
- Weighted independent perfect domination on cocomparability graphsDiscrete Applied Mathematics, 1995
- Clique Partitions, Graph Compression and Speeding-Up AlgorithmsJournal of Computer and System Sciences, 1995
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphsInformation Processing Letters, 1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- The weighted perfect domination problemInformation Processing Letters, 1990
- Decomposition of graphsCybernetics and Systems Analysis, 1985
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965