Add to ORKGTwo vertices in a graph are called an even pair if all induced paths between these two vertices have even length. A graph is called minimal even pair free if the graph does not contain an even pair but every induced subgraph contains an even pair or is a clique. We will characterize all graphs that have the property that the graph and its complement are minimal even pair free. This characterization allows a new formulation of the Strong Perfect Graph ConjectureSIGLEAvailable from TIB Hannover: RN 4052(93795) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
AbstractWe will characterize all graphs that have the property that the graph and its complement are...
AbstractWe will characterize all graphs that have the property that the graph and its complement are...
Two non-adjacent vertices in a graph form an even pair if every chordless path between them has an ...
Two non-adjacent vertices x and y in a graph G form an even pair if every induced path between them ...
Contribution à un ouvrage.Two nonadjacent vertices x and y in a graph G form an even pair if every i...
AbstractAn even pair in a graph is a pair of non-adjacent vertices such that every chordless path be...
AbstractA pair of vertices of a graph is called an even pair if every chordless path between them ha...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole, and n...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole, and n...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole, and n...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole, and n...
AbstractThe Even Pair Lemma, proved by Meyniel, states that no minimal imperfect graph contains a pa...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
AbstractWe will characterize all graphs that have the property that the graph and its complement are...
AbstractWe will characterize all graphs that have the property that the graph and its complement are...
Two non-adjacent vertices in a graph form an even pair if every chordless path between them has an ...
Two non-adjacent vertices x and y in a graph G form an even pair if every induced path between them ...
Contribution à un ouvrage.Two nonadjacent vertices x and y in a graph G form an even pair if every i...
AbstractAn even pair in a graph is a pair of non-adjacent vertices such that every chordless path be...
AbstractA pair of vertices of a graph is called an even pair if every chordless path between them ha...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole, and n...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole, and n...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole, and n...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole, and n...
AbstractThe Even Pair Lemma, proved by Meyniel, states that no minimal imperfect graph contains a pa...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...