介绍强完美图定理(The Strong Perfect Graph Theorem,SPGT)的历史和获证经过,同时简述SPGT被克服后生发的一些新问题,以期对图理论的一般研究起到鼓励和促进作用.因具体的证明浩大聱曲,在技术的部分仅注重框架而不涉及细节.中文核心期刊要目总览(PKU)中国科技核心期刊(ISTIC)中国科学引文数据库(CSCD)02153-1623
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
AbstractWe will characterize all graphs that have the property that the graph and its complement are...
To define perfect graphs first we need to review several graph parameters. Given a graph G = (V,E), ...
In 1961, Claude Berge proposed the \strong perfect graph conjecture", probably the most beautif...
International audienceThe Strong Perfect Graph Conjecture (SPGC) was certainly one of the most chall...
AbstractThe Strong Perfect Graph Conjecture (SPGC) was certainly one of the most challenging conject...
In 1961, Claude Berge proposed the “strong perfect graph conjecture”, probably the most beautiful op...
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theor...
SIGLECNRS RS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
AbstractA graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equa...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
The Strong Perfect Graph Conjecture of Claude Berge is now nearly 25 years old. Efforts to resolve t...
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
AbstractWe will characterize all graphs that have the property that the graph and its complement are...
To define perfect graphs first we need to review several graph parameters. Given a graph G = (V,E), ...
In 1961, Claude Berge proposed the \strong perfect graph conjecture", probably the most beautif...
International audienceThe Strong Perfect Graph Conjecture (SPGC) was certainly one of the most chall...
AbstractThe Strong Perfect Graph Conjecture (SPGC) was certainly one of the most challenging conject...
In 1961, Claude Berge proposed the “strong perfect graph conjecture”, probably the most beautiful op...
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theor...
SIGLECNRS RS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
AbstractA graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equa...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
The Strong Perfect Graph Conjecture of Claude Berge is now nearly 25 years old. Efforts to resolve t...
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
AbstractWe will characterize all graphs that have the property that the graph and its complement are...
To define perfect graphs first we need to review several graph parameters. Given a graph G = (V,E), ...
DOI
Add to ORKG