A new characterization of P6-free graphs
Authors:
- Pim van ’T HofPHPim van ’T Hof
- Daniël PaulusmaDPDaniël Paulusma
- 6 April 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (7) , 731-740
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Characterization of -free graphsDiscrete Applied Mathematics, 2007
- A simple linear time algorithm for cograph recognitionDiscrete Applied Mathematics, 2005
- Dominating Bipartite Subgraphs in GraphsDiscussiones Mathematicae Graph Theory, 2005
- 3-Colorability
P for P6-free graphsDiscrete Applied Mathematics, 2004 - LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P6-FREE GRAPHSInternational Journal of Foundations of Computer Science, 2003
- Dominating subgraphs in graphs with some forbidden structuresDiscrete Mathematics, 1994
- Dominating cliques in P5-free graphsPeriodica Mathematica Hungarica, 1990
- Dominating cliques in graphsDiscrete Mathematics, 1990
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- The comparability graph of a treeProceedings of the American Mathematical Society, 1962