On the sibling - structure of perfect graphs

The perfectly matchable subgraph polytope of an arbitrary graph

Balas, E.
Pulleyblank, W.R.
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

January 1987

Bibliothek Weltwirtschaft Kiel C 151960 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technisch...

On the co-P 3 -structure of perfect graphs

Chính T. Hoang

January 2002

Let F be a family of graphs. Two graphs G 1 = (V 1 , E 1 ), G 2 = (V 2 , E 2 ) are said to have the...

On the disc-structure of perfect graphs II. The co-C4-structure

Hoàng, Chı́nh T.

May 2002

AbstractLet F be any family of graphs. Two graphs G1=(V1,E1),G2=(V2,E2) are said to have the same F-...

On BF-perfect graphs

Schmidt, B.H.
Mehlhorn, K.
Saarland Univ., Saarbruecken (Germany). Fachbereich 10 - Angewandte Mathematik und Informatik
Kaiserslautern Univ. (Germany). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)
Saarland Univ., Saarbruecken (Germany). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet

January 1985

SIGLETIB: RO 1829 (1985,34) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

On the sibling-structure of perfect graphs

Hoàng, C.T

August 1990

AbstractTwo vertices x, y are siblings with respect to a set Q if both Q∪{x} and Q∪{y} induce a P4. ...

New properties of perfectly orderable graphs and strongly perfect graphs

Hoang, Chinh T.
Maffray, Frederic
Preissmann, Myriam

January 1990

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Almost all Berge graphs are perfect

Proemel, Hans J.
Steger, Angelika

January 1991

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Structure theorems for graphs

Preen, J

January 1993

SIGLEAvailable from British Library Document Supply Centre- DSC:DX178651 / BLDSC - British Library D...

Families of graphs complete for the strong perfect graph conjecture

Corneil, D.G.
Centre National de la Recherche Scientifique (CNRS), 38 - Saint-Martin-d'Heres (France). Informatique et Mathematiques Appliquees de Grenoble
Grenoble-1 Univ., 38 (France)
Institut National Polytechnique de Grenoble, 38 (France)

January 1984

SIGLECNRS RS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

On edge perfectness and classes of bipartite graphs

Mueller, Haiko
Forschungsinstitut fuer Diskrete Mathematik, Bonn (Germany)

January 1992

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

On the two-edge-colourings of perfect graphs

Hoang, Chinh T.

January 1989

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

On the reconstruction of combinatorial structures from line-graphs

Erdos, Peter L.

January 1990

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

(a,b)-Factorizations of graphs

Cai, Mao-cheng

January 1988

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

On the complexity of recognizing perfectly orderable graphs

Middendorf, M.
Pfeiffer, Frank

January 1989

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Perfect graphs

Lim, Yvette F.

January 1995

The main objective of the study is to consolidate the works of Berge, Lovasz and Golumbic on finite ...

The perfectly matchable subgraph polytope of an arbitrary graph

Balas, E.
Pulleyblank, W.R.
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

January 1987

Bibliothek Weltwirtschaft Kiel C 151960 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technisch...

On the co-P 3 -structure of perfect graphs

Chính T. Hoang

January 2002

Let F be a family of graphs. Two graphs G 1 = (V 1 , E 1 ), G 2 = (V 2 , E 2 ) are said to have the...

On the disc-structure of perfect graphs II. The co-C4-structure

Hoàng, Chı́nh T.

May 2002

AbstractLet F be any family of graphs. Two graphs G1=(V1,E1),G2=(V2,E2) are said to have the same F-...

On BF-perfect graphs

Schmidt, B.H.
Mehlhorn, K.
Saarland Univ., Saarbruecken (Germany). Fachbereich 10 - Angewandte Mathematik und Informatik
Kaiserslautern Univ. (Germany). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)
Saarland Univ., Saarbruecken (Germany). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet

January 1985

SIGLETIB: RO 1829 (1985,34) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

On the sibling-structure of perfect graphs

Hoàng, C.T

August 1990

AbstractTwo vertices x, y are siblings with respect to a set Q if both Q∪{x} and Q∪{y} induce a P4. ...

New properties of perfectly orderable graphs and strongly perfect graphs

Hoang, Chinh T.
Maffray, Frederic
Preissmann, Myriam

January 1990

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Almost all Berge graphs are perfect

Proemel, Hans J.
Steger, Angelika

January 1991

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Structure theorems for graphs

Preen, J

January 1993

SIGLEAvailable from British Library Document Supply Centre- DSC:DX178651 / BLDSC - British Library D...

Families of graphs complete for the strong perfect graph conjecture

Corneil, D.G.
Centre National de la Recherche Scientifique (CNRS), 38 - Saint-Martin-d'Heres (France). Informatique et Mathematiques Appliquees de Grenoble
Grenoble-1 Univ., 38 (France)
Institut National Polytechnique de Grenoble, 38 (France)

January 1984

SIGLECNRS RS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

On edge perfectness and classes of bipartite graphs

Mueller, Haiko
Forschungsinstitut fuer Diskrete Mathematik, Bonn (Germany)

January 1992

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

On the two-edge-colourings of perfect graphs

Hoang, Chinh T.

January 1989

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

On the reconstruction of combinatorial structures from line-graphs

Erdos, Peter L.

January 1990

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

(a,b)-Factorizations of graphs

Cai, Mao-cheng

January 1988

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

On the complexity of recognizing perfectly orderable graphs

Middendorf, M.
Pfeiffer, Frank

January 1989

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Perfect graphs

Lim, Yvette F.

January 1995

The main objective of the study is to consolidate the works of Berge, Lovasz and Golumbic on finite ...

The perfectly matchable subgraph polytope of an arbitrary graph

Balas, E.
Pulleyblank, W.R.
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

January 1987

Bibliothek Weltwirtschaft Kiel C 151960 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technisch...

On the co-P 3 -structure of perfect graphs

Chính T. Hoang

January 2002

Let F be a family of graphs. Two graphs G 1 = (V 1 , E 1 ), G 2 = (V 2 , E 2 ) are said to have the...

On the disc-structure of perfect graphs II. The co-C4-structure

Hoàng, Chı́nh T.

May 2002

AbstractLet F be any family of graphs. Two graphs G1=(V1,E1),G2=(V2,E2) are said to have the same F-...

On the sibling - structure of perfect graphs

Abstract

Extracted data

On the sibling - structure of perfect graphs

Abstract

Extracted data

Related items

Related items