Intersecting longest paths
暂无分享,去创建一个
Cristina G. Fernandes | Yoshiko Wakabayashi | Susanna F. de Rezende | Daniel M. Martin | Yoshiko Wakabayashi
[1] Branko Grünbaum,et al. Vertices Missed by Longest Paths or Circuits , 1974, J. Comb. Theory, Ser. A.
[2] Zdzislaw Skupien,et al. Smallest Sets of Longest Paths with Empty Intersection , 1996, Combinatorics, Probability and Computing.
[3] Heinz-Jürgen Voss,et al. Über Kreise in Graphen , 1974 .
[4] Werner Schmitz. Über längste Wege und Kreise in Graphen , 1975 .
[5] Cristina G. Fernandes,et al. Intersection of Longest Paths in a Graph , 2011, Electron. Notes Discret. Math..
[6] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .
[7] Charles J. Colbourn,et al. Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.
[8] Hansjoachim Walther,et al. Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen , 1969 .
[9] Richard H. Schelp,et al. Longest Paths in Circular Arc Graphs , 2004, Combinatorics, Probability and Computing.
[10] Tudor Zamfirescu,et al. On longest paths and circuits in graphs. , 1976 .
[11] Scott Kensell,et al. Intersection of longest paths , 2011 .
[12] Maria Axenovich. When do Three Longest Paths have a Common Vertex? , 2009, Discret. Math. Algorithms Appl..
[13] Carsten Thomassen. Planar and infinite hypohamiltonian and hypotraceable graphs , 1976, Discret. Math..
[14] Tudor Zamfirescu,et al. A two-connected planar graph without concurrent longest paths , 1972 .
[15] Hansjoachim Walther. Über die Nichtexistenz zweier Knotenpunkte eines Graphen, die alle längsten Kreise fassen , 1970 .