Algorithms on clique separable graphs

@article{Gavril1977AlgorithmsOC,
  title={Algorithms on clique separable graphs},
  author={Fanica Gavril},
  journal={Discret. Math.},
  year={1977},
  volume={19},
  pages={159-165}
}
  • Fanica Gavril
  • Published in Discret. Math. 1977
  • Computer Science, Mathematics
  • Abstract We define a family of graphs, called the clique separable graphs , characterized by the fact that they have completely connected cut sets by which we decompose them into parts such that when no further decomposition is possible we have a set of simple subgraphs. For example the chordal graphs and the i -triangulated graphs are clique separable graphs. The purpose of this paper is to describe polynomial time algorithms for the recognition of the clique separable graphs and for finding… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 30 CITATIONS

    Separability and Vertex Ordering of Graphs

    VIEW 6 EXCERPTS
    CITES BACKGROUND, METHODS & RESULTS
    HIGHLY INFLUENCED

    A Description of Claw-Free Perfect Graphs

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Recognizing claw-free perfect graphs

    VIEW 3 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Clique-decomposition revisited

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Threat, support and dead edges in the Shannon game

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Stabilité et coloration des graphes sans P5

    VIEW 1 EXCERPT
    CITES BACKGROUND

    An Introduction to Clique Minimal Separator Decomposition

    VIEW 2 EXCERPTS
    CITES BACKGROUND