
- 1 B. Bollobhs, Random Graphs, Academic Press, 1985.Google Scholar
- 2 T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, Mass., 1990. Google Scholar
Digital Library
- 3 R. Johnsonbaugh, Discrete Mathematics, 2nd ed.~ Macmillan, New York, 1990. Google Scholar
Digital Library
- 4 D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, Mass., 1981. Google Scholar
Digital Library
- 5 R. Sedgewick, Algorithms, 2nd ed., Addison- Wesley, Reading, Mass., 1988. Google Scholar
Digital Library
Index Terms
A graph generation software package
Recommendations
On the generation of bicliques of a graph
An independent set of a graph is a subset of pairwise non-adjacent vertices. A complete bipartite set B is a subset of vertices admitting a bipartition B=X∪Y, such that both X and Y are independent sets, and all vertices of X are adjacent to those of Y. If ...
Collapsible subgraphs of a 4-edge-connected graph
AbstractJaeger in 1979 showed that every 4-edge-connected graph is supereulerian, graphs that have spanning eulerian subgraphs. Catlin in 1988 sharpened Jaeger’s result by showing that every 4-edge-connected graph is collapsible, graphs that ...






Comments