Matches in DBpedia 2015-10 for { ?s ?p "The Wiener–Araya graph is, in graph theory, a graph on 42 verticeswith 67 edges. It is hypohamiltonian, which means thatit does not itself have a Hamiltonian cycle but every graph formed byremoving a single vertex from it is Hamiltonian. It is also planar."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Wiener–Araya_graph abstract "The Wiener–Araya graph is, in graph theory, a graph on 42 verticeswith 67 edges. It is hypohamiltonian, which means thatit does not itself have a Hamiltonian cycle but every graph formed byremoving a single vertex from it is Hamiltonian. It is also planar.".
- Wiener–Araya_graph comment "The Wiener–Araya graph is, in graph theory, a graph on 42 verticeswith 67 edges. It is hypohamiltonian, which means thatit does not itself have a Hamiltonian cycle but every graph formed byremoving a single vertex from it is Hamiltonian. It is also planar.".