Graf bipartit (Romanian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graf bipartit" in Romanian language version.

refsWebsite

Global rank Romanian rank

10books.google.com

3^rd place

6^th place

10doi.org

2^nd place

3^rd place

5wikidata.org

43^rd place

2^nd place

1diestel-graph-theory.com

low place

1academia.edu

121^st place

129^th place

1arxiv.org

69^th place

132^nd place

1princeton.edu

741^st place

687^th place

1psu.edu

207^th place

281^st place

1ams.org

451^st place

697^th place

1web.archive.org

1^st place

1siam.org

low place

academia.edu

Bracey, Robert (2012). „On the Graphical Interpreation of Herod's Coinage in Judaea and Rome in Coins”. pp. 65–84.

ams.org

Brualdi, Richard A.; Harary, Frank; Miller, Zevi (1980), „Bigraphs versus digraphs via matrices”, Journal of Graph Theory, 4 (1): 51–73, doi:10.1002/jgt.3190040107, MR 0558453 .

arxiv.org

Bandelt, H.-J.; Chepoi, V.; Eppstein, D. (2010), „Combinatorics and geometry of finite and infinite squaregraphs”, SIAM Journal on Discrete Mathematics^⁠(d), 24 (4): 1399–1440, arXiv:0905.4537 , doi:10.1137/090760301 .

books.google.com

Scheinerman, Edward R. (2012), Mathematics: A Discrete Introduction (ed. 3rd), Cengage Learning, p. 363, ISBN 9780840049421
Chartrand, Gary; Zhang, Ping (2008), Chromatic Graph Theory, Discrete Mathematics And Its Applications, 53, CRC Press, p. 223, ISBN 9781584888000 .
Wasserman, Stanley; Faust, Katherine (1994), Social Network Analysis: Methods and Applications, Structural Analysis in the Social Sciences, 8, Cambridge University Press, pp. 299–302, ISBN 9780521387071 .
Biggs, Norman (1994), Algebraic Graph Theory, Cambridge Mathematical Library (ed. 2nd), Cambridge University Press, p. 53, ISBN 9780521458979
Gross, Jonathan L.; Yellen, Jay (2005), Graph Theory and Its Applications, Discrete Mathematics And Its Applications (ed. 2nd), CRC Press, p. 568, ISBN 9781584885054
Chartrand, Gary; Zhang, Ping (2012), A First Course in Graph Theory, Courier Dover Publications, pp. 189–190, ISBN 9780486483689 .
Béla Bollobás^⁠(d) (1998), Modern Graph Theory, Graduate Texts in Mathematics, 184, Springer, p. 165, ISBN 9780387984889 .
Moon, Todd K. (2005), Error Correction Coding: Mathematical Methods and Algorithms, John Wiley & Sons, p. 638, ISBN 9780471648000 Mai multe valori specificate pentru |ISBN= și |isbn= (ajutor).
Cassandras, Christos G.; Lafortune, Stephane (2007), Introduction to Discrete Event Systems (ed. 2nd), Springer, p. 224, ISBN 9780387333328 Mai multe valori specificate pentru |ISBN= și |isbn= (ajutor)
Grünbaum, Branko (2009), Configurations of Points and Lines, Graduate Studies in Mathematics, 103, American Mathematical Society, p. 28, ISBN 9780821843086 Mai multe valori specificate pentru |ISBN= și |isbn= (ajutor).

diestel-graph-theory.com

Diestel, Reinard (2005). Graph Theory, Grad. Texts in Math. Springer. ISBN 978-3-642-14278-9.

doi.org

Bandelt, H.-J.; Chepoi, V.; Eppstein, D. (2010), „Combinatorics and geometry of finite and infinite squaregraphs”, SIAM Journal on Discrete Mathematics^⁠(d), 24 (4): 1399–1440, arXiv:0905.4537 , doi:10.1137/090760301 .
Archdeacon, D.; Debowsky, M.; Dinitz, J.; Gavlas, H. (2004), „Cycle systems in the complete bipartite graph minus a one-factor”, Discrete Mathematics^⁠(d), 284 (1–3): 37–43, doi:10.1016/j.disc.2003.11.021 .
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), „The strong perfect graph theorem”, Annals of Mathematics^⁠(d), 164 (1): 51–229, CiteSeerX 10.1.1.111.7265 , doi:10.4007/annals.2006.164.51 .
Brualdi, Richard A.; Harary, Frank; Miller, Zevi (1980), „Bigraphs versus digraphs via matrices”, Journal of Graph Theory, 4 (1): 51–73, doi:10.1002/jgt.3190040107, MR 0558453 .
Eppstein, David (2009), „Testing bipartiteness of geometric intersection graphs”, ACM Transactions on Algorithms, 5 (2): Art. 15, doi:10.1145/1497290.1497291 Mai multe valori specificate pentru |DOI= și |doi= (ajutor)
Yannakakis, Mihalis (1978), „Node-and edge-deletion NP-complete problems”, Proceedings of the 10th ACM Symposium on Theory of Computing (STOC '78)^⁠(d), pp. 253–264, doi:10.1145/800133.804355 Mai multe valori specificate pentru |DOI= și |doi= (ajutor)
Reed, Bruce; Smith, Kaleigh; Vetta, Adrian (2004), „Finding odd cycle transversals”, Operations Research Letters, 32 (4): 299–301, doi:10.1016/j.orl.2003.10.009 Mai multe valori specificate pentru |DOI= și |doi= (ajutor).
Hüffner, Falk (2005), „Algorithm engineering for optimal graph bipartization”, Experimental and Efficient Algorithms: 240–252, doi:10.1007/11427186_22 Mai multe valori specificate pentru |DOI= și |doi= (ajutor).
Guo, Jiong; Gramm, Jens; Hüffner, Falk; Niedermeier, Rolf; Wernicke, Sebastian (2006), „Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization”, JCSS: 1386–1396, doi:10.1016/j.jcss.2006.02.001 Mai multe valori specificate pentru |DOI= și |doi= (ajutor)
Hopcroft, John E.; Karp, Richard M. (1973), „An n^5/2 algorithm for maximum matchings in bipartite graphs”, SIAM Journal on Computing, 2 (4): 225–231, doi:10.1137/0202019 Mai multe valori specificate pentru |DOI= și |doi= (ajutor).

princeton.edu

annals.princeton.edu

Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), „The strong perfect graph theorem”, Annals of Mathematics^⁠(d), 164 (1): 51–229, CiteSeerX 10.1.1.111.7265 , doi:10.4007/annals.2006.164.51 .

psu.edu

citeseerx.ist.psu.edu

Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), „The strong perfect graph theorem”, Annals of Mathematics^⁠(d), 164 (1): 51–229, CiteSeerX 10.1.1.111.7265 , doi:10.4007/annals.2006.164.51 .

siam.org

Robinson, Sara (aprilie 2003), „Are Medical Students Meeting Their (Best Possible) Match?” (PDF), SIAM News (3): 36, arhivat din original (PDF) la 18 noiembrie 2016, accesat în 19 iunie 2017

web.archive.org

Robinson, Sara (aprilie 2003), „Are Medical Students Meeting Their (Best Possible) Match?” (PDF), SIAM News (3): 36, arhivat din original (PDF) la 18 noiembrie 2016, accesat în 19 iunie 2017

wikidata.org

Bandelt, H.-J.; Chepoi, V.; Eppstein, D. (2010), „Combinatorics and geometry of finite and infinite squaregraphs”, SIAM Journal on Discrete Mathematics^⁠(d), 24 (4): 1399–1440, arXiv:0905.4537 , doi:10.1137/090760301 .
Archdeacon, D.; Debowsky, M.; Dinitz, J.; Gavlas, H. (2004), „Cycle systems in the complete bipartite graph minus a one-factor”, Discrete Mathematics^⁠(d), 284 (1–3): 37–43, doi:10.1016/j.disc.2003.11.021 .
Béla Bollobás^⁠(d) (1998), Modern Graph Theory, Graduate Texts in Mathematics, 184, Springer, p. 165, ISBN 9780387984889 .
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), „The strong perfect graph theorem”, Annals of Mathematics^⁠(d), 164 (1): 51–229, CiteSeerX 10.1.1.111.7265 , doi:10.4007/annals.2006.164.51 .
Yannakakis, Mihalis (1978), „Node-and edge-deletion NP-complete problems”, Proceedings of the 10th ACM Symposium on Theory of Computing (STOC '78)^⁠(d), pp. 253–264, doi:10.1145/800133.804355 Mai multe valori specificate pentru |DOI= și |doi= (ajutor)