Interval graph (English Wikipedia)

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

refsWebsite

Global rank English rank

17doi.org

2^nd place

7ams.org

451^st place

277^th place

5arxiv.org

69^th place

59^th place

5semanticscholar.org

11^th place

8^th place

3psu.edu

207^th place

136^th place

3nih.gov

4^th place

2books.google.com

3^rd place

2jstor.org

26^th place

20^th place

1archive.org

6^th place

1worldcat.org

5^th place

1handle.net

102^nd place

76^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

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
Beyerl & Jamison (2008). Beyerl, Jeffery J.; Jamison, Robert E. (2008), "Interval graphs with containment restrictions", Proceedings of the Thirty-Ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 191, pp. 117–128, arXiv:1109.6675, MR 2489816
Klavík, Otachi & Šejnoha (2019). Klavík, Pavel; Otachi, Yota; Šejnoha, Jiří (2019), "On the classes of interval graphs of limited nesting and count of lengths", Algorithmica, 81 (4): 1490–1511, arXiv:1510.03998, doi:10.1007/s00453-018-0481-y, MR 3936165, S2CID 254028486
Hanlon (1982), Table VIII, p. 422. Hanlon, Phil (1982), "Counting interval graphs", Transactions of the American Mathematical Society, 272 (2): 383–426, doi:10.2307/1998705, JSTOR 1998705, MR 0662044
Hanlon (1982), Table VII, p. 421. Hanlon, Phil (1982), "Counting interval graphs", Transactions of the American Mathematical Society, 272 (2): 383–426, doi:10.2307/1998705, JSTOR 1998705, MR 0662044
Yang & Pippenger (2017). Yang, Joyce C.; Pippenger, Nicholas (2017), "On the enumeration of interval graphs", Proceedings of the American Mathematical Society, Series B, 4: 1–3, arXiv:1609.02479, doi:10.1090/bproc/27, MR 3613306, S2CID 38225412
Bonnet et al. (2022). Bonnet, Édouard; Kim, Eun Jung; Thomassé, Stéphan; Watrigant, Rémi (2022), "Twin-width I: Tractable FO model checking", Journal of the ACM, 69 (1): A3:1–A3:46, arXiv:2004.14789, doi:10.1145/3486655, MR 4402362

archive.org (Global: 6^th place; English: 6^th place)

McKee & McMorris (1999); Brandstädt, Le & Spinrad (1999) McKee, Terry A.; McMorris, F. R. (1999), Topics in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications, ISBN 978-0-89871-430-2 Brandstädt, A.; Le, V.B.; Spinrad, J.P. (1999), Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, ISBN 978-0-89871-432-6

arxiv.org (Global: 69^th place; English: 59^th place)

Beyerl & Jamison (2008). Beyerl, Jeffery J.; Jamison, Robert E. (2008), "Interval graphs with containment restrictions", Proceedings of the Thirty-Ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 191, pp. 117–128, arXiv:1109.6675, MR 2489816
Klavík, Otachi & Šejnoha (2019). Klavík, Pavel; Otachi, Yota; Šejnoha, Jiří (2019), "On the classes of interval graphs of limited nesting and count of lengths", Algorithmica, 81 (4): 1490–1511, arXiv:1510.03998, doi:10.1007/s00453-018-0481-y, MR 3936165, S2CID 254028486
Bliznets et al. (2014). Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał (2014), "A subexponential parameterized algorithm for proper interval completion", in Schulz, Andreas S.; Wagner, Dorothea (eds.), Proceedings of the 22nd Annual European Symposium on Algorithms (ESA 2014), Wroclaw, Poland, September 8–10, 2014, Lecture Notes in Computer Science, vol. 8737, Springer-Verlag, pp. 173–184, arXiv:1402.3473, doi:10.1007/978-3-662-44777-2_15, ISBN 978-3-662-44776-5, S2CID 12385294
Yang & Pippenger (2017). Yang, Joyce C.; Pippenger, Nicholas (2017), "On the enumeration of interval graphs", Proceedings of the American Mathematical Society, Series B, 4: 1–3, arXiv:1609.02479, doi:10.1090/bproc/27, MR 3613306, S2CID 38225412
Bonnet et al. (2022). Bonnet, Édouard; Kim, Eun Jung; Thomassé, Stéphan; Watrigant, Rémi (2022), "Twin-width I: Tractable FO model checking", Journal of the ACM, 69 (1): A3:1–A3:46, arXiv:2004.14789, doi:10.1145/3486655, MR 4402362

books.google.com (Global: 3^rd place; English: 3^rd place)

Cohen (1978), pp. ix–10. Cohen, Joel E. (1978), Food webs and niche space, Monographs in Population Biology, vol. 11, Princeton, NJ: Princeton University Press, pp. 1–189, ISBN 978-0-691-08202-8, PMID 683203
Cohen (1978), pp. 12–33. Cohen, Joel E. (1978), Food webs and niche space, Monographs in Population Biology, vol. 11, Princeton, NJ: Princeton University Press, pp. 1–189, ISBN 978-0-691-08202-8, PMID 683203

doi.org (Global: 2^nd place; English: 2^nd place)

Lekkerkerker & Boland (1962). Lekkerkerker, C. G.; Boland, J. C. (1962), "Representation of a finite graph by a set of intervals on the real line", Fundamenta Mathematicae, 51: 45–64, doi:10.4064/fm-51-1-45-64
Fulkerson & Gross (1965); Fishburn (1985) Fulkerson, D. R.; Gross, O. A. (1965), "Incidence matrices and interval graphs", Pacific Journal of Mathematics, 15 (3): 835–855, doi:10.2140/pjm.1965.15.835 Fishburn, Peter C. (1985), Interval orders and interval graphs: A study of partially ordered sets, Wiley-Interscience Series in Discrete Mathematics, New York: John Wiley & Sons
Gilmore & Hoffman (1964). Gilmore, P. C.; Hoffman, A. J. (1964), "A characterization of comparability graphs and of interval graphs", Canadian Journal of Mathematics, 16: 539–548, doi:10.4153/CJM-1964-055-5
Hsu (1992). Hsu, Wen-Lian (1992), "A simple test for interval graphs", in Mayr, Ernst W. (ed.), Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19–20, 1992, Proceedings, Lecture Notes in Computer Science, vol. 657, Springer, pp. 11–16, doi:10.1007/3-540-56402-0_31, ISBN 978-3-540-56402-7
Eckhoff (1993). Eckhoff, Jürgen (1993), "Extremal interval graphs", Journal of Graph Theory, 17 (1): 117–127, doi:10.1002/jgt.3190170112
Roberts (1969); Gardi (2007) Roberts, F. S. (1969), "Indifference graphs", in Harary, Frank (ed.), Proof Techniques in Graph Theory, New York, NY: Academic Press, pp. 139–146, ISBN 978-0123242600, OCLC 30287853 Gardi, Frédéric (2007), "The Roberts characterization of proper and unit interval graphs", Discrete Mathematics, 307 (22): 2906–2908, doi:10.1016/j.disc.2006.04.043
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
Klavík, Otachi & Šejnoha (2019). Klavík, Pavel; Otachi, Yota; Šejnoha, Jiří (2019), "On the classes of interval graphs of limited nesting and count of lengths", Algorithmica, 81 (4): 1490–1511, arXiv:1510.03998, doi:10.1007/s00453-018-0481-y, MR 3936165, S2CID 254028486
Zhang et al. (1994). Zhang, Peisen; Schon, Eric A.; Fischer, Stuart G.; Cayanis, Eftihia; Weiss, Janie; Kistler, Susan; Bourne, Philip E. (1994), "An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA", Bioinformatics, 10 (3): 309–317, doi:10.1093/bioinformatics/10.3.309, PMID 7922688
Golumbic & Shamir (1993). Golumbic, Martin Charles; Shamir, Ron (1993), "Complexity and algorithms for reasoning about time: a graph-theoretic approach", Journal of the ACM, 40 (5): 1108–1133, CiteSeerX 10.1.1.35.528, doi:10.1145/174147.169675, S2CID 15708027
Villanger et al. (2009). Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne (2009), "Interval completion is fixed parameter tractable", SIAM Journal on Computing, 38 (5): 2007–2020, CiteSeerX 10.1.1.73.8999, doi:10.1137/070710913, S2CID 8521105
Bliznets et al. (2014). Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał (2014), "A subexponential parameterized algorithm for proper interval completion", in Schulz, Andreas S.; Wagner, Dorothea (eds.), Proceedings of the 22nd Annual European Symposium on Algorithms (ESA 2014), Wroclaw, Poland, September 8–10, 2014, Lecture Notes in Computer Science, vol. 8737, Springer-Verlag, pp. 173–184, arXiv:1402.3473, doi:10.1007/978-3-662-44777-2_15, ISBN 978-3-662-44776-5, S2CID 12385294
Bodlaender (1998). Bodlaender, Hans L. (1998), "A partial $k$ -arboretum of graphs with bounded treewidth", Theoretical Computer Science, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4, hdl:1874/18312
Hanlon (1982), Table VIII, p. 422. Hanlon, Phil (1982), "Counting interval graphs", Transactions of the American Mathematical Society, 272 (2): 383–426, doi:10.2307/1998705, JSTOR 1998705, MR 0662044
Hanlon (1982), Table VII, p. 421. Hanlon, Phil (1982), "Counting interval graphs", Transactions of the American Mathematical Society, 272 (2): 383–426, doi:10.2307/1998705, JSTOR 1998705, MR 0662044
Yang & Pippenger (2017). Yang, Joyce C.; Pippenger, Nicholas (2017), "On the enumeration of interval graphs", Proceedings of the American Mathematical Society, Series B, 4: 1–3, arXiv:1609.02479, doi:10.1090/bproc/27, MR 3613306, S2CID 38225412
Bonnet et al. (2022). Bonnet, Édouard; Kim, Eun Jung; Thomassé, Stéphan; Watrigant, Rémi (2022), "Twin-width I: Tractable FO model checking", Journal of the ACM, 69 (1): A3:1–A3:46, arXiv:2004.14789, doi:10.1145/3486655, MR 4402362

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Bodlaender (1998). Bodlaender, Hans L. (1998), "A partial $k$ -arboretum of graphs with bounded treewidth", Theoretical Computer Science, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4, hdl:1874/18312

jstor.org (Global: 26^th place; English: 20^th place)

Hanlon (1982), Table VIII, p. 422. Hanlon, Phil (1982), "Counting interval graphs", Transactions of the American Mathematical Society, 272 (2): 383–426, doi:10.2307/1998705, JSTOR 1998705, MR 0662044
Hanlon (1982), Table VII, p. 421. Hanlon, Phil (1982), "Counting interval graphs", Transactions of the American Mathematical Society, 272 (2): 383–426, doi:10.2307/1998705, JSTOR 1998705, MR 0662044

nih.gov (Global: 4^th place; English: 4^th place)

pubmed.ncbi.nlm.nih.gov

Cohen (1978), pp. ix–10. Cohen, Joel E. (1978), Food webs and niche space, Monographs in Population Biology, vol. 11, Princeton, NJ: Princeton University Press, pp. 1–189, ISBN 978-0-691-08202-8, PMID 683203
Cohen (1978), pp. 12–33. Cohen, Joel E. (1978), Food webs and niche space, Monographs in Population Biology, vol. 11, Princeton, NJ: Princeton University Press, pp. 1–189, ISBN 978-0-691-08202-8, PMID 683203
Zhang et al. (1994). Zhang, Peisen; Schon, Eric A.; Fischer, Stuart G.; Cayanis, Eftihia; Weiss, Janie; Kistler, Susan; Bourne, Philip E. (1994), "An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA", Bioinformatics, 10 (3): 309–317, doi:10.1093/bioinformatics/10.3.309, PMID 7922688

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Proskurowski & Telle (1999). Proskurowski, Andrzej; Telle, Jan Arne (1999), "Classes of graphs with restricted interval models", Discrete Mathematics & Theoretical Computer Science, 3 (4): 167–176, CiteSeerX 10.1.1.39.9532
Golumbic & Shamir (1993). Golumbic, Martin Charles; Shamir, Ron (1993), "Complexity and algorithms for reasoning about time: a graph-theoretic approach", Journal of the ACM, 40 (5): 1108–1133, CiteSeerX 10.1.1.35.528, doi:10.1145/174147.169675, S2CID 15708027
Villanger et al. (2009). Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne (2009), "Interval completion is fixed parameter tractable", SIAM Journal on Computing, 38 (5): 2007–2020, CiteSeerX 10.1.1.73.8999, doi:10.1137/070710913, S2CID 8521105

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Klavík, Otachi & Šejnoha (2019). Klavík, Pavel; Otachi, Yota; Šejnoha, Jiří (2019), "On the classes of interval graphs of limited nesting and count of lengths", Algorithmica, 81 (4): 1490–1511, arXiv:1510.03998, doi:10.1007/s00453-018-0481-y, MR 3936165, S2CID 254028486
Golumbic & Shamir (1993). Golumbic, Martin Charles; Shamir, Ron (1993), "Complexity and algorithms for reasoning about time: a graph-theoretic approach", Journal of the ACM, 40 (5): 1108–1133, CiteSeerX 10.1.1.35.528, doi:10.1145/174147.169675, S2CID 15708027
Villanger et al. (2009). Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne (2009), "Interval completion is fixed parameter tractable", SIAM Journal on Computing, 38 (5): 2007–2020, CiteSeerX 10.1.1.73.8999, doi:10.1137/070710913, S2CID 8521105
Bliznets et al. (2014). Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał (2014), "A subexponential parameterized algorithm for proper interval completion", in Schulz, Andreas S.; Wagner, Dorothea (eds.), Proceedings of the 22nd Annual European Symposium on Algorithms (ESA 2014), Wroclaw, Poland, September 8–10, 2014, Lecture Notes in Computer Science, vol. 8737, Springer-Verlag, pp. 173–184, arXiv:1402.3473, doi:10.1007/978-3-662-44777-2_15, ISBN 978-3-662-44776-5, S2CID 12385294
Yang & Pippenger (2017). Yang, Joyce C.; Pippenger, Nicholas (2017), "On the enumeration of interval graphs", Proceedings of the American Mathematical Society, Series B, 4: 1–3, arXiv:1609.02479, doi:10.1090/bproc/27, MR 3613306, S2CID 38225412

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Roberts (1969); Gardi (2007) Roberts, F. S. (1969), "Indifference graphs", in Harary, Frank (ed.), Proof Techniques in Graph Theory, New York, NY: Academic Press, pp. 139–146, ISBN 978-0123242600, OCLC 30287853 Gardi, Frédéric (2007), "The Roberts characterization of proper and unit interval graphs", Discrete Mathematics, 307 (22): 2906–2908, doi:10.1016/j.disc.2006.04.043

Interval graph (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 69th place; English: 59th place)

books.google.com (Global: 3rd place; English: 3rd place)

doi.org (Global: 2nd place; English: 2nd place)

handle.net (Global: 102nd place; English: 76th place)