Author:
Sales Cláudia Linhares,Maffray Frédéric,Reed Bruce
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. Bertschi, M.: La colorabilité unique dans les graphes parfaits. PhD thesis, Institut de Mathématiques, Université de Lausanne, Switzerland, 1988
2. Bertschi, M.E.: Perfectly contractile graphs. J. Comb. Theory Ser. B 50, 222–230 (1990)
3. Fonlupt, J., Uhry, J.P.: Transformations which preserve perfectness and h-perfectness of graphs. Ann. of Disc. Maths. 16, 83–85 (1982)
4. Hertz, A., de Werra, D.: Perfectly orderable graphs are quasi-parity graphs: a short proof. Disc. Math. 68, 111–113 (1988)
5. Hsu, W.-L.: Coloring planar perfect graphs by decomposition. Combinatorica, 6, 381–385 (1986)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Perfectly contractile graphs and quadratic toric rings;Bulletin of the London Mathematical Society;2022-12-29
2. A class of perfectly contractile graphs;Journal of Combinatorial Theory, Series B;2006-01
3. Algorithms for Perfectly Contractile Graphs;SIAM Journal on Discrete Mathematics;2005-01
4. On dart-free perfectly contractile graphs;Theoretical Computer Science;2004-08
5. On the coloration of perfect graphs;Recent Advances in Algorithms and Combinatorics;2003