{"paper":{"title":"Graphes parfaits : structure et algorithmes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicolas Trotignon","submitted_at":"2013-08-31T14:17:06Z","abstract_excerpt":"This work is the PhD thesis of Nicolas Trotignon, written in 2004 under the supervision of Fr\\'ed\\'eric Maffray. It is motivated by the desire for a better understanding of perfect graphs. The proof of the Claude Berge's perfect graph conjecture in 2002 by Chudnovsky, Robertson, Seymour and Thomas has shed a new light on this field of combinatorics. But some questions are still unsettled, particulary the existence of a combinatorial algorithm for the coloring of perfect graphs.\n  An even pair of a graph is a pair of vertices such that every path joining them has even length. As proved by Fonlu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0119","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}