On linear and circular structure of (claw, net)-free graphs
Authors:
- Andreas BrandstädtABAndreas Brandstädt
- Feodor F. DraganFDFeodor F. Dragan
- 1 August 2003
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 129 (2-3) , 285-303
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free GraphsSIAM Journal on Computing, 2000
- Independent Sets in Asteroidal Triple-Free GraphsSIAM Journal on Discrete Mathematics, 1999
- Graph Classes: A Survey1999
- Asteroidal Triple-Free GraphsSIAM Journal on Discrete Mathematics, 1997
- LexBFS-orderings and powers of chordal graphsDiscrete Mathematics, 1997
- A linear time algorithm to compute a dominating path in an AT-free graphInformation Processing Letters, 1995
- A Linear Time Algorithm for Deciding Interval Graph IsomorphismJournal of the ACM, 1979
- On domination and independent domination numbers of a graphDiscrete Mathematics, 1978
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Partial orders of dimension 2Networks, 1972