E. W. Dijkstra
- [1] Kruskal jr., J. B.: On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem. Proc. Amer. Math. Soc. 7, 48–50 (1956).Google Scholar
- [2] Loberman, H., and A. Weinberger: Formal Procedures for Connecting Terminals with a Minimum Total Wire Length. J. Ass. Comp. Mach. 4, 428–437 (1957).Google Scholar
- [3] Ford, L. R.: Network flow theory. Rand Corp. Paper, P-923, 1956.Google Scholar
- [4] Berge, C.: Théorie des graphes et ses applications, pp. 68–69. Paris: Dunod 1958.Google Scholar
Index Terms
- A Note on Two Problems in Connexion with Graphs
Index terms have been assigned to the content through auto-classification.
Recommendations
On 4-γt -critical graphs of diameter two
A vertex subset S of graph G is a total dominating set of G if every vertex of G is adjacent to a vertex in S. For a graph G with no isolated vertex, the total domination number of G, denoted by @c"t(G), is the minimum cardinality of a total dominating ...
A note on Hadwiger’s conjecture for W 5-free graphs with independence number two
AbstractThe Hadwiger number of a graph G, denoted h ( G ), is the largest integer t such that G contains K t as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph G, h ( G ) ≥ χ ( G ), where χ ( G ) denotes the ...
A note on connected dominating sets of distance-hereditary graphs
A vertex subset of a graph is a dominating set if every vertex of the graph belongs to the set or has a neighbor in it. A connected dominating set is a dominating set such that the induced subgraph of the set is a connected graph. A graph is called ...
Comments