AbstractRecently Middendorf and Pfeiffer proved that recognizing perfectly orderable graphs is NP-complete. Hoàng and Reed had previously studied six natural subclasses of perfectly orderable graphs that are defined by the orientations of the P4's. Four of the six classes can be recognized in polynomial time. We show in this paper that it is NP-complete to recognize the fifth class
We investigate the following conjecture of Vašek Chvátal: any weakly triangulated graph containing n...
AbstractWe characterize a new class of perfectly orderable graphs and give a polynomial-time recogni...
A simple graph is P4-indifferent if it admits a total order b > c > d. P4-indifferent graphs gener...
AbstractThe question whether a polynomial time recognition algorithm for the class of perfectly orde...
AbstractRecently Middendorf and Pfeiffer proved that recognizing perfectly orderable graphs is NP-co...
AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...
Rapport interne.Chvátal, Lenhart and Sbihi identified six classes of graphs that are perfect if and ...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
Abstract. Hoàng and Reed defined the classes of Raspail (also known as Bipolarizable) and P4-simplic...
AbstractThis paper generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...
The classes of Raspail (also known as Bipolarizable) and P_4-simplicial graphs were introduced by Ho...
AbstractA graph is perfect if the size of the maximum clique equals the chromatic number in every in...
AbstractIn 1981, Chvátal defined the class of perfectly orderable graphs. This class of perfect grap...
The classes of Raspail (also known as Bipolarizable) and P 4-simplicial graphs were introduced b...
Abstract. We consider the problem of recognizing whether a simple undirected graph is a P4-comparabi...
We investigate the following conjecture of Vašek Chvátal: any weakly triangulated graph containing n...
AbstractWe characterize a new class of perfectly orderable graphs and give a polynomial-time recogni...
A simple graph is P4-indifferent if it admits a total order b > c > d. P4-indifferent graphs gener...
AbstractThe question whether a polynomial time recognition algorithm for the class of perfectly orde...
AbstractRecently Middendorf and Pfeiffer proved that recognizing perfectly orderable graphs is NP-co...
AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...
Rapport interne.Chvátal, Lenhart and Sbihi identified six classes of graphs that are perfect if and ...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
Abstract. Hoàng and Reed defined the classes of Raspail (also known as Bipolarizable) and P4-simplic...
AbstractThis paper generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...
The classes of Raspail (also known as Bipolarizable) and P_4-simplicial graphs were introduced by Ho...
AbstractA graph is perfect if the size of the maximum clique equals the chromatic number in every in...
AbstractIn 1981, Chvátal defined the class of perfectly orderable graphs. This class of perfect grap...
The classes of Raspail (also known as Bipolarizable) and P 4-simplicial graphs were introduced b...
Abstract. We consider the problem of recognizing whether a simple undirected graph is a P4-comparabi...
We investigate the following conjecture of Vašek Chvátal: any weakly triangulated graph containing n...
AbstractWe characterize a new class of perfectly orderable graphs and give a polynomial-time recogni...
A simple graph is P4-indifferent if it admits a total order b > c > d. P4-indifferent graphs gener...
DOI
Add to ORKG