Research output: Contribution to journal › Article › peer-review
Connectivity is one of the basic concepts of graph theory. It asks for the minimum number of elements. A graph is called k-connected or k-vertex-connected if its vertex connectivity is k or greater. The author defines a connected component of a graph as a vertex set of its maximal up to inclusion connected subgraph.
Original language | English |
---|---|
Pages (from-to) | 279-312 |
Number of pages | 34 |
Journal | Fundamenta Informaticae |
Volume | 145 |
Issue number | 3 |
DOIs | |
State | Published - 1 Jan 2016 |
ID: 36925247