Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Series-parallel_networks_problem> ?p ?o. }
Showing items 1 to 17 of
17
with 100 items per page.
- Series-parallel_networks_problem abstract "In combinatorial mathematics, the series-parallel networks problem asks for the number of series-parallel networks that can be formed using a given number of edges. The edges can be distinguishable or indistinguishable.".
- Series-parallel_networks_problem wikiPageExternalLink 9707023.
- Series-parallel_networks_problem wikiPageID "873839".
- Series-parallel_networks_problem wikiPageRevisionID "460963125".
- Series-parallel_networks_problem hasPhotoCollection Series-parallel_networks_problem.
- Series-parallel_networks_problem name "Number of series-parallel networks with n unlabeled edges".
- Series-parallel_networks_problem name "Number of series-reduced planted trees with n leaves".
- Series-parallel_networks_problem sequencenumber "A000084".
- Series-parallel_networks_problem sequencenumber "A000669".
- Series-parallel_networks_problem subject Category:Graph_enumeration.
- Series-parallel_networks_problem comment "In combinatorial mathematics, the series-parallel networks problem asks for the number of series-parallel networks that can be formed using a given number of edges. The edges can be distinguishable or indistinguishable.".
- Series-parallel_networks_problem label "Series-parallel networks problem".
- Series-parallel_networks_problem sameAs m.03klfk.
- Series-parallel_networks_problem sameAs Q7454785.
- Series-parallel_networks_problem sameAs Q7454785.
- Series-parallel_networks_problem wasDerivedFrom Series-parallel_networks_problem?oldid=460963125.
- Series-parallel_networks_problem isPrimaryTopicOf Series-parallel_networks_problem.