Result 1 to 20 of 82 total
Skew partitions in perfect graphs. (English)
Discrete Appl. Math. 156, No. 7, 1150-1156 (2008).
1
The strong perfect graph theorem. (Le théorème fort des graphes parfaits.) (French)
Séminaire Bourbaki. Volume 2005/2006. Exposés Nos. 952‒966. Paris: Société Mathématique de France (ISBN 978-2-85629-230-3/pbk). Astérisque 311, 123-135, Exp. No. 957 (2007).
2
How the proof of the strong perfect graph conjecture was found. (English)
Gaz. Math., Soc. Math. Fr. 109, 69-83 (2006).
3
Decomposing Berge graphs containing no proper wheel, long prism or their complements. (English)
Combinatorica 26, No. 5, 533-558 (2006).
4
Recognizing Berge graphs. (English)
Combinatorica 25, No. 2, 143-186 (2005).
5
The perfection and recognition of bull-reducible Berge graphs. (English)
Theor. Inform. Appl. 39, No. 1, 145-160 (2005).
6
The clique-rank of 3-chromatic perfect graphs. (English)
Grötschel, Martin (ed.), The sharpest cut. The impact of Manfred Padberg and his work. Papers from the workshop in honor of Manfred Padberg’s 60th birthday, Berlin, Germany, October 11‒13, 2001. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). Philadelphia, PA: MPS, Mathematical Programming Society (ISBN 0-89871-552-0/hbk). MPS/SIAM Series on Optimization 4, 39-49 (2004).
7
Vertex colouring and forbidden subgraphs ‒ a survey. (English)
Graphs Comb. 20, No. 1, 1-40 (2004).
8
Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs. (English)
J. Comb. Theory, Ser. B 87, No.2, 300-330 (2003).
9
On the quasi-locally paw-free graphs. (English)
Discrete Math. 266, No.1-3, 37-40 (2003).
10
Recursive generation of partitionable graphs. (English)
J. Graph Theory 41, No.4, 259-285 (2002).
11
The strong perfect graph conjecture. (English)
Li, Ta Tsien (ed.) et al., Proceedings of the international congress of mathematicians, ICM 2002, Beijing, China, August 20-28, 2002. Vol. III: Invited lectures. Beijing: Higher Education Press. 547-559 (2002).
12
On the divisibility of graphs. (English)
Discrete Math. 242, No.1-3, 145-156 (2002).
13
A transformation which preserves the clique number. (English)
J. Comb. Theory, Ser. B 83, No.2, 320-330 (2001).
14
On kernel-less clique-acyclic orientations of minimally imperfect graphs. (English)
Discrete Appl. Math. 115, No.1-3, 209-219 (2001).
15
Some aspects of minimal imperfect graphs. (English)
Ramírez Alfonsín, Jorge L. (ed.) et al., Perfect graphs. Chichester: Wiley. Wiley-Interscience Series in Discrete Mathematics and Optimization. 185-214 (2001).
16
Cutsets in perfect and minimal imperfect graphs. (English)
Ramírez Alfonsín, Jorge L. (ed.) et al., Perfect graphs. Chichester: Wiley. Wiley-Interscience Series in Discrete Mathematics and Optimization. 167-183 (2001).
17
From conjecture to theorem. (English)
Ramírez Alfonsín, Jorge L. (ed.) et al., Perfect graphs. Chichester: Wiley. Wiley-Interscience Series in Discrete Mathematics and Optimization. 13-24 (2001).
18
Almost perfect matrices and graphs. (English)
Math. Oper. Res. 26, No. 1, 1-18 (2001).
19
On Tucker’s proof of the strong perfect graph conjecture for $(K_4-e)$-free graphs. (English)
Discrete Math. 232, No.1-3, 105-108 (2001).
20
Result 1 to 20 of 82 total
Start
Contact
Print
General Help
