Highly linked graphs
暂无分享,去创建一个
[1] Frank Harary,et al. Graph Theory , 2016 .
[2] Andreas Huck,et al. A sufficient condition for graphs to be weaklyk-linked , 1991, Graphs Comb..
[3] W. Mader. Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte , 1972 .
[4] JANOS KOMLOS,et al. Topological cliques in graphs II , 1994, Combinatorics, Probability and Computing.
[5] W. Mader. Homomorphieeigenschaften und mittlere Kantendichte von Graphen , 1967 .
[6] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[7] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.
[8] Carsten Thomassen,et al. 2-Linked Graphs , 1980, Eur. J. Comb..
[9] P. Mani,et al. On the Existence of Certain Configurations within Graphs and the 1‐Skeletons of Polytopes , 1970 .
[10] G. Dirac,et al. A Theorem of Kuratowski , 1954 .
[11] H. Jung. Eine Verallgemeinerung desn-fachen Zusammenhangs für Graphen , 1970 .
[12] Tomio Hirata,et al. A sufficient condition for a graph to be weakly k-linked , 1984, J. Comb. Theory, Ser. B.
[13] Carsten Thomassen,et al. Highly connected non-2-linked digraphs , 1991, Comb..
[14] A. Thomason. An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.
[15] B. Bollobás,et al. Extremal Graph Theory , 2013 .
[16] W. Mader. Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind , 1972 .