AbstractA Hoàng graph G = (V, E) is a graph whose edges may be coloured with two colours (red and white) such that no induced path on four vertices has wings of the same colour. Hoàng (1995) conjectured that these graphs are perfect and proved two partial results concerning their perfectness. We use here a different technique to establish that for reducible Hoàng graphs this conjecture is true
A ß-perfect graph is a simple graph G such that ¿(G') = ß(G') for every induced subgraph G' of G, wh...
A ß-perfect graph is a simple graph G such that ¿(G') = ß(G') for every induced subgraph G' of G, wh...
AbstractWe present easily verifiable conditions, under which a graph G contains nonempty vertex-disj...
AbstractA Hoàng graph G = (V, E) is a graph whose edges may be coloured with two colours (red and wh...
AbstractWe show that there are, up to a trivial equivalence, precisely six theorems of the following...
AbstractWe show that there are, up to a trivial equivalence, precisely six theorems of the following...
AbstractThe class ofβ-perfect graphs is introduced. We draw a number of parallels between these grap...
AbstractAn edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v...
An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y a...
The main objective of the study is to consolidate the works of Berge, Lovasz and Golumbic on finite ...
An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y a...
An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y a...
AbstractWe establish a property of minimal imperfect graphs, and use this property to generate two c...
AbstractA new property of minimal imperfect graphs is given. This leads to a way to add a new vertex...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
A ß-perfect graph is a simple graph G such that ¿(G') = ß(G') for every induced subgraph G' of G, wh...
A ß-perfect graph is a simple graph G such that ¿(G') = ß(G') for every induced subgraph G' of G, wh...
AbstractWe present easily verifiable conditions, under which a graph G contains nonempty vertex-disj...
AbstractA Hoàng graph G = (V, E) is a graph whose edges may be coloured with two colours (red and wh...
AbstractWe show that there are, up to a trivial equivalence, precisely six theorems of the following...
AbstractWe show that there are, up to a trivial equivalence, precisely six theorems of the following...
AbstractThe class ofβ-perfect graphs is introduced. We draw a number of parallels between these grap...
AbstractAn edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v...
An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y a...
The main objective of the study is to consolidate the works of Berge, Lovasz and Golumbic on finite ...
An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y a...
An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y a...
AbstractWe establish a property of minimal imperfect graphs, and use this property to generate two c...
AbstractA new property of minimal imperfect graphs is given. This leads to a way to add a new vertex...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
A ß-perfect graph is a simple graph G such that ¿(G') = ß(G') for every induced subgraph G' of G, wh...
A ß-perfect graph is a simple graph G such that ¿(G') = ß(G') for every induced subgraph G' of G, wh...
AbstractWe present easily verifiable conditions, under which a graph G contains nonempty vertex-disj...
DOI
Add to ORKG