Skip to main content Accessibility help
×
Home

The Strong Perfect Graph Conjecture for Planar Graphs

  • Alan Tucker (a1)

Extract

A graph G is called γ-perfect if ƛ (H) = γ(H) for every vertex-generated subgraph H of G. Here, ƛ(H) is the clique number of H (the size of the largest clique of H) and γ(H) is the chromatic number of H (the minimum number of independent sets of vertices that cover all vertices of H). A graph G is called α-perfect if α(H) = θ(H) for every vertex-generated subgraph H of G, where α (H) is the stability number of H (the size of the largest independent set of H) and θ(H) is the partition number of H (the minimum number of cliques that cover all vertices of H).

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      The Strong Perfect Graph Conjecture for Planar Graphs
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      The Strong Perfect Graph Conjecture for Planar Graphs
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      The Strong Perfect Graph Conjecture for Planar Graphs
      Available formats
      ×

Copyright

References

Hide All
l. Berge, C., Färbung von Graphen, derensämtlichebzw. derenungeradeKreisestarrsind, Wiss. Martin-Luther Univ. Halle-Wittenberg Math.-Natur. 1961.
2. Berge, C., Some classes of perfect graphs, in Graph theory and theoretical physics, Harary, F. (ed.) (Academic Press, New York, 1967).
3. Berge, C., The rank of a family of sets and some applications to graph theory, in Recent advances incombinatorics, Tutte, W. T. (ed.) (Academic Press, New York, 1969).
4. Fulkerson, D. R., The perfect graph conjecture and pluperfect graph theorem, in Second Chapel Hill Conference on combinatorial mathematics and its applications, Dowling, T. (éd.), (Chapel Hill, 1970).
5. Lovász, L., Normal hyper graphs and the perfect graph conjecture, Discrete Math. 2 (1972), 253268.
6. Ore, O., The theory of graphs, AMS Colloquium Series, 1962.
7. Shannon, C. E., The zero-error capacity of a noisy channel, IRE Trans. Info. Thy.ITS (1956), 3.
8. Tucker, A. C., Perfect graphs and an application to optimizing municipal services, SIAM Rev., July (1973).
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

The Strong Perfect Graph Conjecture for Planar Graphs

  • Alan Tucker (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed