Which claw-free graphs are perfectly orderable

Minimal claw-free graphs

Dankelmann, P.
Swart, Henda C.
van den Berg, P.
Goddard, W.
Plummer, M. D.

January 2008

summary:A graph $G$ is a minimal claw-free graph (m.c.f. graph) if it contains no $K_{1,3}$ (claw) a...

New classes of perfectly orderable graphs

Fouquet, J.-L.
Roussel, F.
Rubio, P.
Thuillier, H.

June 2001

AbstractThis paper generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...

Bipartite subgraphs of triangle-free graphs

Karlova Univ., Prague (Czechoslovakia). Fakulta Matematicko-Fyzikalni)
Tuza, Z. (Hungarian Academy of Sciences, Budapest (Hungary). Computer and Automation Inst.)
Poljak, S. (Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

January 1991

SIGLEAvailable from TIB Hannover: RN 4052(91686-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...

Which claw-free graphs are perfectly orderable?

Chvatal, Vasek

January 1990

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

Which claw-free graphs are perfectly orderable?

Chvátal, Vašek

July 1993

AbstractAn undirected graph is called perfectly orderable if the set of its vertices admits a linear...

On ordered graphs and graph orderings

Nesetril, J. (Bonn Univ. (Germany))
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)

January 1991

SIGLEAvailable from TIB Hannover: RN 4052(91712-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...

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...

New properties of perfectly orderable graphs and strongly perfect graphs

Hoang, C.T.
Maffray, F.
Preissman, M.
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research

January 1990

SIGLETIB: RN 4052(90641-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

The complexity of recognizing weakly triangulated graphs that are perfectly orderable

Hoang, C.T.
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Alexander von Humboldt-Stiftung (AvH), Bonn (Germany)
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)

January 1990

SIGLETIB: RN 4052(89638-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

Path factors in claw-free graphs

Ando, Kiyoshi
Egawa, Yoshimi
Kaneko, Atsushi
Kawarabayashi, Ken-ichi
Matsuda, Haruhide

January 2002

AbstractA graph G is called claw-free if G has no induced subgraph isomorphic to K1,3. We prove that...

Quasi-claw-free graphs

Ainouche, A.

January 1998

AbstractA graph G is quasi claw-free if it satisfies the property: d(x, y) = 2 ⇒ there exists u ϵ N(...

A note on perfectly orderable graphs

Hoàng, Chinh T.

March 1996

AbstractWe introduce a new class of perfectly orderable graphs that contains complements of chordal ...

Recognition of some perfectly orderable graph classes

M. Eschen, Elaine
L. Johnson, Julie
P. Spinrad, Jeremy
Sritharan, R

June 2003

AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...

The clique-rank of diamond-free perfect graphs

Fonlupt, J.
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research

January 1992

With 5 figs.Available from TIB Hannover: RN4052(92772) / FIZ - Fachinformationszzentrum Karlsruhe / ...

A characterization of claw-free b-perfect graphs

Karthick, T.
Maffray, Frédéric

January 2012

AbstractWe characterize the class of claw-free b-perfect graphs by giving a complete description of ...

Minimal claw-free graphs

Dankelmann, P.
Swart, Henda C.
van den Berg, P.
Goddard, W.
Plummer, M. D.

January 2008

summary:A graph $G$ is a minimal claw-free graph (m.c.f. graph) if it contains no $K_{1,3}$ (claw) a...

New classes of perfectly orderable graphs

Fouquet, J.-L.
Roussel, F.
Rubio, P.
Thuillier, H.

June 2001

AbstractThis paper generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...

Bipartite subgraphs of triangle-free graphs

Karlova Univ., Prague (Czechoslovakia). Fakulta Matematicko-Fyzikalni)
Tuza, Z. (Hungarian Academy of Sciences, Budapest (Hungary). Computer and Automation Inst.)
Poljak, S. (Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

January 1991

SIGLEAvailable from TIB Hannover: RN 4052(91686-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...

Which claw-free graphs are perfectly orderable?

Chvatal, Vasek

January 1990

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

Which claw-free graphs are perfectly orderable?

Chvátal, Vašek

July 1993

AbstractAn undirected graph is called perfectly orderable if the set of its vertices admits a linear...

On ordered graphs and graph orderings

Nesetril, J. (Bonn Univ. (Germany))
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)

January 1991

SIGLEAvailable from TIB Hannover: RN 4052(91712-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...

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...

New properties of perfectly orderable graphs and strongly perfect graphs

Hoang, C.T.
Maffray, F.
Preissman, M.
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research

January 1990

SIGLETIB: RN 4052(90641-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

The complexity of recognizing weakly triangulated graphs that are perfectly orderable

Hoang, C.T.
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Alexander von Humboldt-Stiftung (AvH), Bonn (Germany)
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)

January 1990

SIGLETIB: RN 4052(89638-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

Path factors in claw-free graphs

Ando, Kiyoshi
Egawa, Yoshimi
Kaneko, Atsushi
Kawarabayashi, Ken-ichi
Matsuda, Haruhide

January 2002

AbstractA graph G is called claw-free if G has no induced subgraph isomorphic to K1,3. We prove that...

Quasi-claw-free graphs

Ainouche, A.

January 1998

AbstractA graph G is quasi claw-free if it satisfies the property: d(x, y) = 2 ⇒ there exists u ϵ N(...

A note on perfectly orderable graphs

Hoàng, Chinh T.

March 1996

AbstractWe introduce a new class of perfectly orderable graphs that contains complements of chordal ...

Recognition of some perfectly orderable graph classes

M. Eschen, Elaine
L. Johnson, Julie
P. Spinrad, Jeremy
Sritharan, R

June 2003

AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...

The clique-rank of diamond-free perfect graphs

Fonlupt, J.
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research

January 1992

With 5 figs.Available from TIB Hannover: RN4052(92772) / FIZ - Fachinformationszzentrum Karlsruhe / ...

A characterization of claw-free b-perfect graphs

Karthick, T.
Maffray, Frédéric

January 2012

AbstractWe characterize the class of claw-free b-perfect graphs by giving a complete description of ...

Minimal claw-free graphs

Dankelmann, P.
Swart, Henda C.
van den Berg, P.
Goddard, W.
Plummer, M. D.

January 2008

summary:A graph $G$ is a minimal claw-free graph (m.c.f. graph) if it contains no $K_{1,3}$ (claw) a...

New classes of perfectly orderable graphs

Fouquet, J.-L.
Roussel, F.
Rubio, P.
Thuillier, H.

June 2001

AbstractThis paper generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...

Bipartite subgraphs of triangle-free graphs

Karlova Univ., Prague (Czechoslovakia). Fakulta Matematicko-Fyzikalni)
Tuza, Z. (Hungarian Academy of Sciences, Budapest (Hungary). Computer and Automation Inst.)
Poljak, S. (Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

January 1991

SIGLEAvailable from TIB Hannover: RN 4052(91686-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...

Which claw-free graphs are perfectly orderable

Abstract

Extracted data

Which claw-free graphs are perfectly orderable

Abstract

Extracted data

Related items

Related items