E. Boros and V. Gurevich [1996], Perfect graphs are kernel solvable, Discrete Math. 159, 35-55. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Stable Families of Coalitions and Normal Hypergraphs - Boros, Gurvich, Vasin (1996) Self-citation (Boros Gurvich) (Correct)
No context found.
E. Boros and V. Gurvich, Perfect graphs are kernel-solvable, Rutcor Research Report 16-1994, To appear in Discrete Mathematics.
A corrected version of the Duchet Kernel Conjecture - Boros, Gurvich (1996) (1 citation) Self-citation (Boros Gurvich) (Correct)
No context found.
E. Boros and V. Gurvich (1994) Perfect graphs are kernel-solvable. Rutcor Research Report 16-94, Dimacs Technical Report 94-32, Rutgers University. To appear in Discrete Mathematics.
A corrected version of the Duchet Kernel Conjecture - Boros, Gurvich (1996) (1 citation) Self-citation (Boros Gurvich) (Correct)
No context found.
E. Boros and V. Gurvich (1994) Perfect graphs are kernel-solvable. Rutcor Research Report 16-94, Dimacs Technical Report 94-32, Rutgers University. To appear in Discrete Mathematics.
Combinatorial Games: Selected Bibliography with a Succinct.. - Fraenkel (2006) (2 citations) (Correct)
No context found.
E. Boros and V. Gurevich [1996], Perfect graphs are kernel solvable, Discrete Math. 159, 35-55.
Integer Polyhedra: Combinatorial Properties and Complexity - Sebö (2001) (Correct)
No context found.
E. Boros, V. Gurvich, Perfect graphs are kernel solvable, Discrete Math. (1996), 159, No.1-3, 35-55.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC