Gabor Bacso, Endre Boros, Vladimir Gurvich, Frederic Maffray, and Myriam Preissmann. On minimal imperfect graphs with circular symmetry. J. Graph Theory, 29(4):209--225, 1998. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
On the Circular Chromatic Number of Circular Partitionable Graphs - Pêcher, Zhu (2003) (Correct)
....G minimal circular imperfect if G is not circular perfect, but every induced subgraph of G is circular perfect. Our results imply that the class of partitionable graphs considered in this paper are circular imperfect. Hence each of them contains a minimal circular imperfect graph. It was shown in [1] (also implied by the Strong Perfect Graph Theorem) that besides the odd cycles of length at least 5 and their complements, none of the circular partitionable graphs C[m 1 ; m 2 ; m 2r ] is minimal imperfect. The question whether any of these graphs are minimal circular imperfect remains ....
Gabor Bacso, Endre Boros, Vladimir Gurvich, Frederic Maffray, and Myriam Preissmann. On minimal imperfect graphs with circular symmetry. J. Graph Theory, 29(4):209--225, 1998.
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