HIGHLIGHTS
SUMMARY
A Hamiltonian cycle is a cycle of a graph that contains every vertex; a graph that contains a Hamiltonian cycle is called Hamiltonian. A graph G is cycle extendable if, for every non-Hamiltonian cycle C, there exists a cycle C ′ such that V (C) ⊂ V (C ′ ) and |V (C ′ )|=|V (C)| + 1 ( the authors say that C extends to C ′ ). A graph is strongly chordal if it is chordal and every even cycle of length at least 6 has a chord that connects vertices at an odd distance from one another along the . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.