DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Claude Berge
Claude Berge
Combinatorics: a First Encounter
Vertex Deletion Problems on Chordal Graphs∗†
The Strong Perfect Graph Theorem
P 4-Colorings and P 4-Bipartite Graphs Chinh T
PDF of the Phd Thesis
Algorithmic Graph Theory Part III Perfect Graphs and Their Subclasses
Classes of Perfect Graphs
Strong Perfect Graph Theorem a Graph G Is Perfect If and Only If Neither G Nor Its Complement G¯ Contains an Induced Odd Circuit of Length ≥ 5
Two Classes of Perfect Graphs
Robin Thomas
8 Cologne-Twente Workshop on Graphs and Combinatorial Optimization CTW09 Proceedings of the Conference
Planar Graphs Have Bounded Nonrepetitive Chromatic Number∗
Claude Berge: 5.6.1926 – 30.6.2002
Interactions Between Cliques and Stable Sets in a Graph Aurelie Lagoutte
2009 Fulkerson Prizes
Curriculum Vitae Maria Chudnovsky
Graph Theory in Paris
MAP Estimation with Perfect Graphs
Top View
Berge-Hypergraphs.Pdf
Maria Chudnovsky Toufik Mansour
Dominating Sets in Perfect Graphs
Perfect Graphs: a Survey
Curriculum Vitae Maria Chudnovsky
Recognizing Berge Graphs
Ôhypergraph Acyclicity Revisited
The Strong Perfect Graph Conjecture: 40 Years of Attempts, and Its Resolution Florian Roussel, Irena Rusu, Henri Thuillier
In Praise of Claude Berge
The Strong Perfect Graph Theorem