Claw-free graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Claw-free graph" in English language version.

refsWebsite

Global rank English rank

16doi.org

2^nd place

14ams.org

451^st place

277^th place

4arxiv.org

69^th place

59^th place

4semanticscholar.org

11^th place

8^th place

1columbia.edu

488^th place

374^th place

1princeton.edu

741^st place

577^th place

1gatech.edu

4,448^th place

2,923^rd place

1psu.edu

207^th place

136^th place

ams.org

mathscinet.ams.org

Faudree, Flandrin & Ryjáček (1997), p. 88. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Faudree, Flandrin & Ryjáček (1997), p. 89. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Chudnovsky & Seymour (2008). Chudnovsky, Maria; Seymour, Paul (2008), "Claw-free graphs. III. Circular interval graphs" (PDF), Journal of Combinatorial Theory, Series B, 98 (4): 812–834, doi:10.1016/j.jctb.2008.03.001, MR 2418774.
Chudnovsky & Seymour (2005). Chudnovsky, Maria; Seymour, Paul (2005), "The structure of claw-free graphs" (PDF), Surveys in combinatorics 2005, London Math. Soc. Lecture Note Ser., vol. 327, Cambridge: Cambridge Univ. Press, pp. 153–171, MR 2187738.
Faudree, Flandrin & Ryjáček (1997), p. 132. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Itai & Rodeh (1978). Itai, Alon; Rodeh, Michael (1978), "Finding a minimum circuit in a graph", SIAM Journal on Computing, 7 (4): 413–423, doi:10.1137/0207033, MR 0508603.
Faudree, Flandrin & Ryjáček (1997), pp. 120–124. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Faudree, Flandrin & Ryjáček (1997), pp. 133–134. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Faudree, Flandrin & Ryjáček (1997), pp. 135–136. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Faudree, Flandrin & Ryjáček (1997) observe on p. 132 that the NP-hardness of cliques in claw-free graphs follows from the NP-hardness of the independent set problem in triangle-free graphs, proven NP-hard by Poljak (1974) Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221. Poljak, Svatopluk (1974), "A note on stable sets and colorings of graphs", Commentationes Mathematicae Universitatis Carolinae, 15: 307–309, MR 0351881.
Gravier & Maffray (2004). Gravier, Sylvain; Maffray, Frédéric (2004), "On the choice number of claw-free perfect graphs", Discrete Mathematics, 276 (1–3): 211–218, doi:10.1016/S0012-365X(03)00292-9, MR 2046636.
Chudnovsky & Seymour (2010). Chudnovsky, Maria; Seymour, Paul (2010), "Claw-free graphs VI. Colouring", Journal of Combinatorial Theory, Series B, 100 (6): 560–572, CiteSeerX 10.1.1.220.7715, doi:10.1016/j.jctb.2010.04.005, MR 2718677.
Faudree, Flandrin & Ryjáček (1997), pp. 124–125. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Cygan et al. (2011); Hermelin et al. (2011). Cygan, Marek; Philip, Geevarghese; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry (2011), "Dominating set is fixed parameter tractable in claw-free graphs", Theoretical Computer Science, 412 (50): 6982–7000, arXiv:1011.6239, doi:10.1016/j.tcs.2011.09.010, MR 2894366, S2CID 16339210. Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard (2011), "Domination when the stars are out", Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I, Lecture Notes in Computer Science, vol. 6755, Zurich, Switzerland, pp. 462–473, arXiv:1012.0012, doi:10.1007/978-3-642-22006-7_39, ISBN 978-3-642-22005-0, S2CID 3080073{{citation}}: CS1 maint: location missing publisher (link).

arxiv.org

Chudnovsky et al. (2006). Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong perfect graph theorem" (PDF), Annals of Mathematics, 164 (1): 51–229, arXiv:math/0212070, doi:10.4007/annals.2006.164.51, S2CID 119151552.
Cygan et al. (2011); Hermelin et al. (2011). Cygan, Marek; Philip, Geevarghese; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry (2011), "Dominating set is fixed parameter tractable in claw-free graphs", Theoretical Computer Science, 412 (50): 6982–7000, arXiv:1011.6239, doi:10.1016/j.tcs.2011.09.010, MR 2894366, S2CID 16339210. Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard (2011), "Domination when the stars are out", Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I, Lecture Notes in Computer Science, vol. 6755, Zurich, Switzerland, pp. 462–473, arXiv:1012.0012, doi:10.1007/978-3-642-22006-7_39, ISBN 978-3-642-22005-0, S2CID 3080073{{citation}}: CS1 maint: location missing publisher (link).
King & Reed (2015). King, Andrew D.; Reed, Bruce A. (2015), "Claw-free graphs, skeletal graphs, and a stronger conjecture on ω, Δ, and χ", Journal of Graph Theory, 78 (3): 157–194, arXiv:1212.3036, doi:10.1002/jgt.21797, S2CID 7385598.
Hermelin et al. (2011). Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard (2011), "Domination when the stars are out", Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I, Lecture Notes in Computer Science, vol. 6755, Zurich, Switzerland, pp. 462–473, arXiv:1012.0012, doi:10.1007/978-3-642-22006-7_39, ISBN 978-3-642-22005-0, S2CID 3080073{{citation}}: CS1 maint: location missing publisher (link).

columbia.edu

Chudnovsky & Seymour (2008). Chudnovsky, Maria; Seymour, Paul (2008), "Claw-free graphs. III. Circular interval graphs" (PDF), Journal of Combinatorial Theory, Series B, 98 (4): 812–834, doi:10.1016/j.jctb.2008.03.001, MR 2418774.

doi.org

Faudree, Flandrin & Ryjáček (1997), p. 88. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Faudree, Flandrin & Ryjáček (1997), p. 89. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Chudnovsky & Seymour (2008). Chudnovsky, Maria; Seymour, Paul (2008), "Claw-free graphs. III. Circular interval graphs" (PDF), Journal of Combinatorial Theory, Series B, 98 (4): 812–834, doi:10.1016/j.jctb.2008.03.001, MR 2418774.
Faudree, Flandrin & Ryjáček (1997), p. 132. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Itai & Rodeh (1978). Itai, Alon; Rodeh, Michael (1978), "Finding a minimum circuit in a graph", SIAM Journal on Computing, 7 (4): 413–423, doi:10.1137/0207033, MR 0508603.
Faudree, Flandrin & Ryjáček (1997), pp. 120–124. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Faudree, Flandrin & Ryjáček (1997), pp. 133–134. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Chudnovsky et al. (2006). Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong perfect graph theorem" (PDF), Annals of Mathematics, 164 (1): 51–229, arXiv:math/0212070, doi:10.4007/annals.2006.164.51, S2CID 119151552.
Faudree, Flandrin & Ryjáček (1997), pp. 135–136. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Faudree, Flandrin & Ryjáček (1997) observe on p. 132 that the NP-hardness of cliques in claw-free graphs follows from the NP-hardness of the independent set problem in triangle-free graphs, proven NP-hard by Poljak (1974) Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221. Poljak, Svatopluk (1974), "A note on stable sets and colorings of graphs", Commentationes Mathematicae Universitatis Carolinae, 15: 307–309, MR 0351881.
Gravier & Maffray (2004). Gravier, Sylvain; Maffray, Frédéric (2004), "On the choice number of claw-free perfect graphs", Discrete Mathematics, 276 (1–3): 211–218, doi:10.1016/S0012-365X(03)00292-9, MR 2046636.
Chudnovsky & Seymour (2010). Chudnovsky, Maria; Seymour, Paul (2010), "Claw-free graphs VI. Colouring", Journal of Combinatorial Theory, Series B, 100 (6): 560–572, CiteSeerX 10.1.1.220.7715, doi:10.1016/j.jctb.2010.04.005, MR 2718677.
Faudree, Flandrin & Ryjáček (1997), pp. 124–125. Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
Cygan et al. (2011); Hermelin et al. (2011). Cygan, Marek; Philip, Geevarghese; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry (2011), "Dominating set is fixed parameter tractable in claw-free graphs", Theoretical Computer Science, 412 (50): 6982–7000, arXiv:1011.6239, doi:10.1016/j.tcs.2011.09.010, MR 2894366, S2CID 16339210. Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard (2011), "Domination when the stars are out", Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I, Lecture Notes in Computer Science, vol. 6755, Zurich, Switzerland, pp. 462–473, arXiv:1012.0012, doi:10.1007/978-3-642-22006-7_39, ISBN 978-3-642-22005-0, S2CID 3080073{{citation}}: CS1 maint: location missing publisher (link).
King & Reed (2015). King, Andrew D.; Reed, Bruce A. (2015), "Claw-free graphs, skeletal graphs, and a stronger conjecture on ω, Δ, and χ", Journal of Graph Theory, 78 (3): 157–194, arXiv:1212.3036, doi:10.1002/jgt.21797, S2CID 7385598.
Hermelin et al. (2011). Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard (2011), "Domination when the stars are out", Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I, Lecture Notes in Computer Science, vol. 6755, Zurich, Switzerland, pp. 462–473, arXiv:1012.0012, doi:10.1007/978-3-642-22006-7_39, ISBN 978-3-642-22005-0, S2CID 3080073{{citation}}: CS1 maint: location missing publisher (link).

gatech.edu

people.math.gatech.edu

Chudnovsky et al. (2006). Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong perfect graph theorem" (PDF), Annals of Mathematics, 164 (1): 51–229, arXiv:math/0212070, doi:10.4007/annals.2006.164.51, S2CID 119151552.

princeton.edu

math.princeton.edu

Chudnovsky & Seymour (2005). Chudnovsky, Maria; Seymour, Paul (2005), "The structure of claw-free graphs" (PDF), Surveys in combinatorics 2005, London Math. Soc. Lecture Note Ser., vol. 327, Cambridge: Cambridge Univ. Press, pp. 153–171, MR 2187738.

psu.edu

citeseerx.ist.psu.edu

Chudnovsky & Seymour (2010). Chudnovsky, Maria; Seymour, Paul (2010), "Claw-free graphs VI. Colouring", Journal of Combinatorial Theory, Series B, 100 (6): 560–572, CiteSeerX 10.1.1.220.7715, doi:10.1016/j.jctb.2010.04.005, MR 2718677.

semanticscholar.org

api.semanticscholar.org

Chudnovsky et al. (2006). Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong perfect graph theorem" (PDF), Annals of Mathematics, 164 (1): 51–229, arXiv:math/0212070, doi:10.4007/annals.2006.164.51, S2CID 119151552.
Cygan et al. (2011); Hermelin et al. (2011). Cygan, Marek; Philip, Geevarghese; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry (2011), "Dominating set is fixed parameter tractable in claw-free graphs", Theoretical Computer Science, 412 (50): 6982–7000, arXiv:1011.6239, doi:10.1016/j.tcs.2011.09.010, MR 2894366, S2CID 16339210. Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard (2011), "Domination when the stars are out", Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I, Lecture Notes in Computer Science, vol. 6755, Zurich, Switzerland, pp. 462–473, arXiv:1012.0012, doi:10.1007/978-3-642-22006-7_39, ISBN 978-3-642-22005-0, S2CID 3080073{{citation}}: CS1 maint: location missing publisher (link).
King & Reed (2015). King, Andrew D.; Reed, Bruce A. (2015), "Claw-free graphs, skeletal graphs, and a stronger conjecture on ω, Δ, and χ", Journal of Graph Theory, 78 (3): 157–194, arXiv:1212.3036, doi:10.1002/jgt.21797, S2CID 7385598.
Hermelin et al. (2011). Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard (2011), "Domination when the stars are out", Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I, Lecture Notes in Computer Science, vol. 6755, Zurich, Switzerland, pp. 462–473, arXiv:1012.0012, doi:10.1007/978-3-642-22006-7_39, ISBN 978-3-642-22005-0, S2CID 3080073{{citation}}: CS1 maint: location missing publisher (link).