Publication date
March 1985
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractIt is shown that graphs which do not have more than 3 mutually uncomparable vertices for the vicinal preorder are strongly perfect
AbstractIt is shown that graphs which do not have more than 3 mutually uncomparable vertices for the vicinal preorder are strongly perfect
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
AbstractLet γ(G), i(G), γS(G) and iS(G) denote the domination number, the independent domination num...
AbstractA graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equa...
AbstractA graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equa...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractMeyniel (Discrete Math.16 (1976), 339–342) proved that a graph is perfect whenever each of i...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
AbstractA graph G is said to be very strongly perfect if for each induced subgraph H of G, each vert...
AbstractRecently, three new families of perfect graphs have given various generalizations of known r...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
AbstractAn undirected graph is trivially perfect if for every induced subgraph the stability number ...
AbstractThis paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to p...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
AbstractLet γ(G), i(G), γS(G) and iS(G) denote the domination number, the independent domination num...
AbstractA graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equa...
AbstractA graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equa...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractMeyniel (Discrete Math.16 (1976), 339–342) proved that a graph is perfect whenever each of i...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
AbstractA graph G is said to be very strongly perfect if for each induced subgraph H of G, each vert...
AbstractRecently, three new families of perfect graphs have given various generalizations of known r...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
AbstractAn undirected graph is trivially perfect if for every induced subgraph the stability number ...
AbstractThis paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to p...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
AbstractLet γ(G), i(G), γS(G) and iS(G) denote the domination number, the independent domination num...
Add to ORKG