Trivially perfect graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Trivially perfect graph" in English language version.

refsWebsite

Global rank English rank

15doi.org

2^nd place

1ams.org

451^st place

277^th place

1arxiv.org

69^th place

59^th place

ams.org

mathscinet.ams.org

Rotem (1981). Rotem, D. (1981), "Stack sortable permutations", Discrete Mathematics, 33 (2): 185–196, doi:10.1016/0012-365X(81)90165-5, MR 0599081.

arxiv.org

Nastos & Gao (2010). Nastos, James; Gao, Yong (2010), "A novel branching strategy for parameterized graph modification problems", in Wu, Weili; Daescu, Ovidiu (eds.), Combinatorial Optimization and Applications – 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18–20, 2010, Proceedings, Part II, Lecture Notes in Computer Science, vol. 6509, Springer, pp. 332–346, arXiv:1006.3020, doi:10.1007/978-3-642-17461-2_27

doi.org

Brandstädt, Le & Spinrad (1999), definition 2.6.2, p.34; Golumbic (1978). Golumbic, Martin Charles (1978), "Trivially perfect graphs", Discrete Mathematics, 24 (1): 105–107, doi:10.1016/0012-365X(78)90178-4.
Wolk (1962); Wolk (1965). Wolk, E. S. (1962), "The comparability graph of a tree", Proceedings of the American Mathematical Society, 13 (5 ed.): 789–795, doi:10.1090/S0002-9939-1962-0172273-0. Wolk, E. S. (1965), "A note on the comparability graph of a tree", Proceedings of the American Mathematical Society, 16 (1 ed.): 17–20, doi:10.1090/S0002-9939-1965-0172274-5.
Donnelly & Isaak (1999). Donnelly, Sam; Isaak, Garth (1999), "Hamiltonian powers in threshold and arborescent comparability graphs", Discrete Mathematics, 202 (1–3): 33–44, doi:10.1016/S0012-365X(98)00346-X
Yan, Chen & Chang (1996). Yan, Jing-Ho; Chen, Jer-Jeong; Chang, Gerard J. (1996), "Quasi-threshold graphs", Discrete Applied Mathematics, 69 (3): 247–255, doi:10.1016/0166-218X(96)00094-7.
Brandstädt, Le & Spinrad (1999), theorem 6.6.1, p. 99; Golumbic (1978), corollary 4. Golumbic, Martin Charles (1978), "Trivially perfect graphs", Discrete Mathematics, 24 (1): 105–107, doi:10.1016/0012-365X(78)90178-4.
Brandstädt, Le & Spinrad (1999), theorem 6.6.1, p. 99; Golumbic (1978), theorem 2. Wolk (1962) and Wolk (1965) proved this for comparability graphs of rooted forests. Golumbic, Martin Charles (1978), "Trivially perfect graphs", Discrete Mathematics, 24 (1): 105–107, doi:10.1016/0012-365X(78)90178-4. Wolk, E. S. (1962), "The comparability graph of a tree", Proceedings of the American Mathematical Society, 13 (5 ed.): 789–795, doi:10.1090/S0002-9939-1962-0172273-0. Wolk, E. S. (1965), "A note on the comparability graph of a tree", Proceedings of the American Mathematical Society, 16 (1 ed.): 17–20, doi:10.1090/S0002-9939-1965-0172274-5.
Wolk (1962). Wolk, E. S. (1962), "The comparability graph of a tree", Proceedings of the American Mathematical Society, 13 (5 ed.): 789–795, doi:10.1090/S0002-9939-1962-0172273-0.
Brandstädt, Le & Spinrad (1999), p. 248; Yan, Chen & Chang (1996), theorem 3. Yan, Jing-Ho; Chen, Jer-Jeong; Chang, Gerard J. (1996), "Quasi-threshold graphs", Discrete Applied Mathematics, 69 (3): 247–255, doi:10.1016/0166-218X(96)00094-7.
Yan, Chen & Chang (1996); Gurski (2006). Yan, Jing-Ho; Chen, Jer-Jeong; Chang, Gerard J. (1996), "Quasi-threshold graphs", Discrete Applied Mathematics, 69 (3): 247–255, doi:10.1016/0166-218X(96)00094-7. Gurski, Frank (2006), "Characterizations for co-graphs defined by restricted NLC-width or clique-width operations", Discrete Mathematics, 306 (2): 271–277, doi:10.1016/j.disc.2005.11.014.
Yan, Chen & Chang (1996), theorem 3. Yan, Jing-Ho; Chen, Jer-Jeong; Chang, Gerard J. (1996), "Quasi-threshold graphs", Discrete Applied Mathematics, 69 (3): 247–255, doi:10.1016/0166-218X(96)00094-7.
Rotem (1981). Rotem, D. (1981), "Stack sortable permutations", Discrete Mathematics, 33 (2): 185–196, doi:10.1016/0012-365X(81)90165-5, MR 0599081.
Rubio-Montiel (2015). Rubio-Montiel, C. (2015), "A new characterization of trivially perfect graphs", Electronic Journal of Graph Theory and Applications, 3 (1): 22–26, doi:10.5614/ejgta.2015.3.1.3.
Brandstädt, Le & Spinrad (1999), theorem 6.6.3, p. 100; Golumbic (1978), corollary 5. Golumbic, Martin Charles (1978), "Trivially perfect graphs", Discrete Mathematics, 24 (1): 105–107, doi:10.1016/0012-365X(78)90178-4.
Cai (1996). Cai, L. (1996), "Fixed-parameter tractability of graph modification problems for hereditary properties", Information Processing Letters, 58 (4): 171–176, doi:10.1016/0020-0190(96)00050-6.
Nastos & Gao (2010). Nastos, James; Gao, Yong (2010), "A novel branching strategy for parameterized graph modification problems", in Wu, Weili; Daescu, Ovidiu (eds.), Combinatorial Optimization and Applications – 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18–20, 2010, Proceedings, Part II, Lecture Notes in Computer Science, vol. 6509, Springer, pp. 332–346, arXiv:1006.3020, doi:10.1007/978-3-642-17461-2_27