### Abstract

A CIS-graph is defined as a graph whose every maximal clique and stable set intersect. These graphs have many interesting properties, yet, it seems difficult to obtain an efficient characterization and/or polynomial-time recognition algorithm for CIS-graphs. An almost CIS-graph is defined as a graph that has a unique pair (C^{e} S) of disjoint maximal clique C and stable sets S. We conjecture that almost CIS-graphs are exactly split graphs that have a unique split par- tition and prove this conjecture for a large hereditary class of graphs that contains, for example, chordal graphs and P _{5}-free graphs, as well as their complements, etc. We also prove the conjecture in case \C\ = \S\ = 2 and show that the vertex-set R = V \ (C U S) cannot induce a threshold graph, although we do not prove that R = 0, as the conjecture suggests.

Original language | English (US) |
---|---|

Pages (from-to) | 163-180 |

Number of pages | 18 |

Journal | Australasian Journal of Combinatorics |

Volume | 43 |

State | Published - Feb 1 2009 |

### All Science Journal Classification (ASJC) codes

- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'On split and almost CIS-graphs'. Together they form a unique fingerprint.

## Cite this

*Australasian Journal of Combinatorics*,

*43*, 163-180.