k-Components, Clusters and Slicings in Graphs
- 1 May 1972
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 22 (3) , 459-480
- https://doi.org/10.1137/0122040
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Bounded color functions on graphsNetworks, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- The cohesive strength of graphsPublished by Springer Nature ,1969
- An inequality for the chromatic number of a graphJournal of Combinatorial Theory, 1968
- Cluster analysis on the Atlas computerThe Computer Journal, 1968
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941