1.Previous
3.Next

Important types of induced subgraphs include the following.
*Induced paths are induced subgraphs that are paths. The shortest path between any two vertices in an unweighted graph is always an induced path, because any additional edges between pairs of vertices that could cause it to be not induced would also cause it to be not shortest. Conversely, in distance-hereditary graphs,

1.Previous
3.Next