Grafo cordale (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Grafo cordale" in Italian language version.

refsWebsite

Global rank Italian rank

2^nd place

7^th place

799^th place

22^nd place

451^st place

2,019^th place

513^th place

577^th place

14^th place

11^th place

580^th place

1,138^th place

ams.org

Dirac (1961). G. A. Dirac, On rigid circuit graphs, in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 25, 1961, 71–76, DOI:10.1007/BF02992776, MR 0130190.
Patil (1986). H. P. Patil, On the structure of k-trees, in Rivista of Combinatorics, Information and System Sciences, vol. 11, 2–4, 1986, 57–64, MR 966069.
Seymour & Weaver (1984). P. D. Seymour e R. W. Weaver, A generalization of chordal graphs, in Rivista of Graph Theory, vol. 8, n. 2, 1984, 241–251, DOI:10.1002/jgt.3190080206, MR 742878.
Parra & Scheffler (1997). Andreas Parra e Petra Scheffler, Characterizations and algorithmic applications of chordal graph embeddings, in Discrete Applied Mathematics, vol. 79, n. 1-3, 1997, 171–188, DOI:10.1016/S0166-218X(97)00041-3, MR 1478250.

archive.today

Fulkerson & Gross (1965). D. R. Fulkerson e O. A. Gross, Incidence matrices and interval graphs, in Pacific J. Math, vol. 15, 1965, 835–855. URL consultato l'8 dicembre 2021 (archiviato dall'url originale il 15 aprile 2013).

berkeley.edu

stat.berkeley.edu

Peter Bartlett, Undirected Graphical Models: Chordal Graphs, Decomposable Graphs, Junction Trees, and Factorizations (PDF), su stat.berkeley.edu.

doi.org

dx.doi.org

Dirac (1961). G. A. Dirac, On rigid circuit graphs, in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 25, 1961, 71–76, DOI:10.1007/BF02992776, MR 0130190.
Bodlaender, Fellows & Warnow (1992). H. L. Bodlaender, M. R. Fellows e T. J. Warnow, Two strikes against perfect phylogeny, in Proc. of 19th International Colloquium on Automata Languages and Programming, Lecture Notes in Computer Science, vol. 623, 1992, 273–283, DOI:10.1007/3-540-55719-9_80.
Berry, Golumbic & Lipshteyn (2007). Anne Berry, Martin Charles Golumbic e Marina Lipshteyn, Recognizing chordal probe graphs and cycle-bicolorable graphs, in SIAM Rivista on Discrete Mathematics, vol. 21, n. 3, 2007, 573–591, DOI:10.1137/050637091.
Maffray (2003). Frédéric Maffray, On the coloration of perfect graphs, in Bruce A. Reed e Cláudia L. Sales (a cura di), Recent Advances in Algorithms and Combinatorics, CMS Books in Mathematics, vol. 11, Springer-Verlag, 2003, 65–84, DOI:10.1007/0-387-22444-0_3, ISBN 0-387-95434-1.
Seymour & Weaver (1984). P. D. Seymour e R. W. Weaver, A generalization of chordal graphs, in Rivista of Graph Theory, vol. 8, n. 2, 1984, 241–251, DOI:10.1002/jgt.3190080206, MR 742878.
Parra & Scheffler (1997). Andreas Parra e Petra Scheffler, Characterizations and algorithmic applications of chordal graph embeddings, in Discrete Applied Mathematics, vol. 79, n. 1-3, 1997, 171–188, DOI:10.1016/S0166-218X(97)00041-3, MR 1478250.

oadoi.org

Dirac (1961). G. A. Dirac, On rigid circuit graphs, in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 25, 1961, 71–76, DOI:10.1007/BF02992776, MR 0130190.
Berry, Golumbic & Lipshteyn (2007). Anne Berry, Martin Charles Golumbic e Marina Lipshteyn, Recognizing chordal probe graphs and cycle-bicolorable graphs, in SIAM Rivista on Discrete Mathematics, vol. 21, n. 3, 2007, 573–591, DOI:10.1137/050637091.
Seymour & Weaver (1984). P. D. Seymour e R. W. Weaver, A generalization of chordal graphs, in Rivista of Graph Theory, vol. 8, n. 2, 1984, 241–251, DOI:10.1002/jgt.3190080206, MR 742878.
Parra & Scheffler (1997). Andreas Parra e Petra Scheffler, Characterizations and algorithmic applications of chordal graph embeddings, in Discrete Applied Mathematics, vol. 79, n. 1-3, 1997, 171–188, DOI:10.1016/S0166-218X(97)00041-3, MR 1478250.

wolfram.com

mathworld.wolfram.com

(EN) Eric W. Weisstein, Triangulated Graph, in MathWorld, Wolfram Research.. Si noti tuttavia che "grafi triangolati" si riferisce talvolta anche ai grafi planari massimali.