Talk:Path graph
Latest comment: 10 years ago by Alejandro Erickson in topic Merge content from Path (graph theory) and redirect that page to this one
This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
Merge content from Path (graph theory) and redirect that page to this one
editThe talk page Talk:Path_graph says the content from this page was merged into Path graph in 2011. The content was apparently copied over, but the redirect does not seem to have been applied. I propose implementing the redirect, and then making the more modern (and graph theoretic) "no repeated vertices" definition prominent, with another section dedicated to alternate definitions (which are subsumed under trail and walk, as far as I know). Alejandro Erickson (talk) 20:55, 9 April 2014 (UTC)
- Oppose merge. They are about different concepts and even different kinds of concept. Path graph is about a special class of graphs, the graphs that consist only of a single path, and is focused on the properties of that very special class of graphs. Path (graph theory) is about a kind of object within an arbitrary graph: a path, and about the different kinds of paths people have studied (Eulerian, Hamiltonian, longest, etc) and what their existence says about the graph containing them. I think the result of a merge would be too schizophrenic to make sense. However, the "different kinds of path graphs" section here seems to be misplaced: I think it should be moved to the other article. —David Eppstein (talk) 21:28, 9 April 2014 (UTC)
- "'agree with oppose merge'". I'll try to clean this up and prevent future confusion. Any required discussion on conflicting definitions of paths in graphs will be on Talk:Path (graph theory) Alejandro Erickson (talk) 10:56, 10 April 2014 (UTC)
- I'm going to end this discussion since we have agreement and no one else has spoken. Alejandro Erickson (talk) 09:42, 14 April 2014 (UTC)