Revision #244 → #1466 · back to history
addedClique number227ec04f7979
addedGraph coloring3ec71b609382
addedChromatic number8973781556d3
addedChromatic number at least clique numberd7be15f27417
addedPerfect graph8d671ffd601c
addedPerfect graph theorem43e8db583dd2
addedPerfect graph (independence = clique cover)8fc117bdd9a2
addedOdd cycle is not perfectd6eb35c521ba
addedStrong perfect graph theorem66e2af503818
addedProduct characterization of perfect graphsbc060856c767
addedGallai: complement of bipartite graph is perfect72c856433a52
addedBerge graphs9c016aa78ee5
addedBipartite graphs are perfectee4e7b1f8f1a
addedTrees and median graphs39cd348360f8
addedKőnig's theorem (matchings and vertex covers)c75f37c6cdfd
addedLine graph and matchingd35bf1f39a07
addedLine graphs of bipartite graphs are perfect38b2c4c66efe
addedRook's graphs23dbcfa4c3df
addedLine graph of bipartite graph in a rook's graph25aa98779e1e
addedKőnig: maximum degree equals chromatic index8a8286c70691
addedVizing's theoremf3cbd70c3b03
addedLine perfect grapheff20777b386
addedLine perfect graphs are perfecta4d606ea27db
addedStructural decomposition of perfect graphs3e561d132b7d
addedPartially ordered setd435b7eee5ec
addedComparable and incomparable elementsdbf7352006bc
addedComparability graph6f324d162aa3
addedIncomparability graphc182e2315124
addedComparability graphs are perfect5de6091fe6f4
addedAntichain68bb2c0e2ebe
addedDilworth's theoremddc581e77d76
addedMirsky's theoremcea481bb8d0f
addedEvery bipartite graph is a comparability graph67b1c674e5d7
addedPermutation grapha6baf053601a
addedCharacterization of permutation graphsb57c283a1db5
addedErdős–Szekeres theorem02ef28fd34b3
addedInterval graphsebed33193c3d
addedTrapezoid graphsca31f5cddac4
addedIndifference graphsc58551d4c3b2
addedTrivially perfect graphs2b625fbe97a8
addedIndependence number equals number of maximal cliques4af83195d1ac
addedSplit grapheb45b834c53e
addedSplit graphs are perfectbcae7b792fc4
addedUnipolar graphsf7bba69cfc1d
addedGeneralized split graphs188d0c8dc2e5
addedAlmost all perfect graphs are generalized split graphs796c03292d90
addedAlmost all perfect graphs are Hamiltonianf9058845306c
addedLimiting induced-subgraph probabilitybc6fd64731a8
addedChordal graphs1d62b8a63dae
addedChordal graphs have no holes1e16aed28e06
addedSplit graphs as chordal with chordal complement3daaa49dd9e6
addedDistance-hereditary graphse8e73d1917a8
addedCographs as comparability graphs of series-parallel orders1bf17004f486
addedPtolemaic graphs814b2971b0cb
addedWindmill and block graphs1866f339a246
addedThreshold graphs3c67d95b7668
addedCharacterization of threshold graphs71e33f61c272
addedGreedy coloring of chordal graphs is optimal905e23ad429c
addedPerfectly orderable graphs5eaca517594e
addedCographs and all vertex orderingsfd9eda998c43
addedStrongly perfect graphs9435221e1cdc
addedMeyniel graphs5ad901d2a74a
addedCharacterization of Meyniel graphs17e09382ccd4
addedParity graph199b785003f9
addedParity graphs are Meyniel and perfect6e09bbc51c27
addedParity graphs and perfect prisms7178cf15384f
addedComplexity of linear and integer programmingf79e57e9c436
addedIntegral linear program22ee9cf0cf8e
addedChvátal: matrices and perfect graphs12fb682fe2c2
addedCoincidence of independent-set and clique polytopesbde1267e5f1e
addedPolynomial-time problems on perfect graphsd8c48853edb5
addedLovász numberaba03702a087
addedLovász number sandwich1bcf359112c0
addedMaximum clique algorithm2e511dcd25e4
addedPolynomial-time recognition of perfect graphs24a459edc7c7
addedχ-bounded graph class1e6aea41f363
addedPerfect graphs as identity χ-bindingd99ded91c47a
addedDomination perfect graphs2baa111bae99
addedClaw-free graphs7279ab36f795