We prove a new property of critical imperfect graphs. As a consequence, we define a new class of perfect graphs. This class contains perfectly orderable graphs and graphs in which that every odd cycle has two chords
AbstractWe first establish a certain property of minimal imperfect graphs and then use it to generat...
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their de...
AbstractCircular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to ...
We prove a new property of critical imperfect graphs. As a consequence, we define a new class of per...
A perfect graph is critical if the deletion of any edge results in an imperfect graph. We give examp...
AbstractAn edge of a graph is calledcritical, if deleting it the stability number of the graph incre...
We call an edge e of a perfect graph G critical if G e is imperfect and call e anticritical if G + ...
AbstractWe introduce a new class of perfectly orderable graphs that contains complements of chordal ...
An edge e of a perfect graph G is critical if G — e is imperfect. We would like to decide whether G ...
AbstractThis paper generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...
AbstractWe establish a property of minimal imperfect graphs, and use this property to generate two c...
AbstractWe establish a property of minimal nonperfectly orderable graphs, and use this property to g...
AbstractThe family of all critically strongly-imperfect graphs decomposes in two nonempty classes: p...
We prove the following theorem: If every, odd cycle of length ≥5 has at least two chords, then the g...
An edge e of a perfect graph G is called critical if G — e is imperfect. For certain graphs G — e of...
AbstractWe first establish a certain property of minimal imperfect graphs and then use it to generat...
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their de...
AbstractCircular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to ...
We prove a new property of critical imperfect graphs. As a consequence, we define a new class of per...
A perfect graph is critical if the deletion of any edge results in an imperfect graph. We give examp...
AbstractAn edge of a graph is calledcritical, if deleting it the stability number of the graph incre...
We call an edge e of a perfect graph G critical if G e is imperfect and call e anticritical if G + ...
AbstractWe introduce a new class of perfectly orderable graphs that contains complements of chordal ...
An edge e of a perfect graph G is critical if G — e is imperfect. We would like to decide whether G ...
AbstractThis paper generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...
AbstractWe establish a property of minimal imperfect graphs, and use this property to generate two c...
AbstractWe establish a property of minimal nonperfectly orderable graphs, and use this property to g...
AbstractThe family of all critically strongly-imperfect graphs decomposes in two nonempty classes: p...
We prove the following theorem: If every, odd cycle of length ≥5 has at least two chords, then the g...
An edge e of a perfect graph G is called critical if G — e is imperfect. For certain graphs G — e of...
AbstractWe first establish a certain property of minimal imperfect graphs and then use it to generat...
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their de...
AbstractCircular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to ...
DOI
Add to ORKG