DOIAbstract
AbstractWe characterize a new class of perfectly orderable graphs and give a polynomial-time recognition algorithm, together with linear-time optimization algorithms for this class of graphs
AbstractWe characterize a new class of perfectly orderable graphs and give a polynomial-time recognition algorithm, together with linear-time optimization algorithms for this class of graphs
A polynomial time membership test and solutions to the minimum coloring and maximum weight clique a...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
SIGLETIB: RN 4052(89638-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
We characterize a new class of perfectly orderable graphs and give a polynomial-time recognition alg...
AbstractWe characterize a new class of perfectly orderable graphs and give a polynomial-time recogni...
Abstract. Hoàng and Reed defined the classes of Raspail (also known as Bipolarizable) and P4-simplic...
AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...
The classes of Raspail (also known as Bipolarizable) and P_4-simplicial graphs were introduced by Ho...
The classes of Raspail (also known as Bipolarizable) and P 4-simplicial graphs were introduced b...
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 generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...
AbstractIn this paper those graphs are studied for which a so-called strong ordering of the vertex s...
AbstractWe consider a construction which associated with a graph G another graph G′ such that if G′ ...
AbstractA graph is perfect if the size of the maximum clique equals the chromatic number in every in...
A polynomial time membership test and solutions to the minimum coloring and maximum weight clique a...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
SIGLETIB: RN 4052(89638-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
We characterize a new class of perfectly orderable graphs and give a polynomial-time recognition alg...
AbstractWe characterize a new class of perfectly orderable graphs and give a polynomial-time recogni...
Abstract. Hoàng and Reed defined the classes of Raspail (also known as Bipolarizable) and P4-simplic...
AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...
The classes of Raspail (also known as Bipolarizable) and P_4-simplicial graphs were introduced by Ho...
The classes of Raspail (also known as Bipolarizable) and P 4-simplicial graphs were introduced b...
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 generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...
AbstractIn this paper those graphs are studied for which a so-called strong ordering of the vertex s...
AbstractWe consider a construction which associated with a graph G another graph G′ such that if G′ ...
AbstractA graph is perfect if the size of the maximum clique equals the chromatic number in every in...
A polynomial time membership test and solutions to the minimum coloring and maximum weight clique a...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
SIGLETIB: RN 4052(89638-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
Add to ORKG