Matches in DBpedia 2015-10 for { ?s ?p "In graph theory, the Lovász conjecture (1970) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex-transitive graph contains a Hamiltonian path.The original article of Lovász stated the result in the opposite, butthis version became standard."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Lovász_conjecture comment "In graph theory, the Lovász conjecture (1970) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex-transitive graph contains a Hamiltonian path.The original article of Lovász stated the result in the opposite, butthis version became standard.".