Matches in DBpedia 2016-04 for { ?s ?p "Tomaž (Tomo) Pisanski (born May 24, 1949 in Ljubljana, Slovenia) is a Slovenian mathematician working mainly in discrete mathematics and graph theory.In 1980 he calculated the genus of the Cartesian product of any pair of connected, bipartite, d-valent graphs using a method that was later called the White–Pisanski method.In 1982 Vladimir Batagelj and Pisanski proved that the Cartesian product of a tree and a cycle is Hamiltonian if and only if no degree of the tree exceeds the length of the cycle. They also proposed a conjecture concerning cyclic Hamiltonicity of graphs. Their conjecture was proved in 2005."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Tomaž_Pisanski abstract "Tomaž (Tomo) Pisanski (born May 24, 1949 in Ljubljana, Slovenia) is a Slovenian mathematician working mainly in discrete mathematics and graph theory.In 1980 he calculated the genus of the Cartesian product of any pair of connected, bipartite, d-valent graphs using a method that was later called the White–Pisanski method.In 1982 Vladimir Batagelj and Pisanski proved that the Cartesian product of a tree and a cycle is Hamiltonian if and only if no degree of the tree exceeds the length of the cycle. They also proposed a conjecture concerning cyclic Hamiltonicity of graphs. Their conjecture was proved in 2005.".
- Q6960377 abstract "Tomaž (Tomo) Pisanski (born May 24, 1949 in Ljubljana, Slovenia) is a Slovenian mathematician working mainly in discrete mathematics and graph theory.In 1980 he calculated the genus of the Cartesian product of any pair of connected, bipartite, d-valent graphs using a method that was later called the White–Pisanski method.In 1982 Vladimir Batagelj and Pisanski proved that the Cartesian product of a tree and a cycle is Hamiltonian if and only if no degree of the tree exceeds the length of the cycle. They also proposed a conjecture concerning cyclic Hamiltonicity of graphs. Their conjecture was proved in 2005.".