Jump to content

Talk:Polytree

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Dr. Universe (talk | contribs) at 02:01, 27 June 2022 (A problem with definitions). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A problem with definitions

The first paragraph of this article allows the underlying undirected graph to be disconnected. However other parts of the paper assume it is connected, such as the alternative name "oriented tree" and the OEIS listing. McKay (talk) 05:48, 10 August 2012 (UTC)[reply]

I notice that has been fixed. Zaslav (talk) 22:27, 9 January 2013 (UTC)[reply]
@David Eppstein: The messages above pertain to something that was already fixed 9 years ago. Why did you put them back? Dr. Universe (talk) 02:01, 27 June 2022 (UTC)[reply]

I put the simplest name "oriented tree" first. (I also wonder how many graph theorists use the name "polytree"?) Zaslav (talk) 22:30, 9 January 2013 (UTC)[reply]

I find this confusing: In other words, it is a directed graph with exactly one directed path between any two vertices;. What is meant is an undirected path (i.e. a path in the undirected tree), isn't it? Below there is talk of an undirected cycle to refer to a cycle in the undirected graph, so the adjectives seem to be used in different senses here. — Preceding unsigned comment added by 2.230.4.151 (talk) 13:12, 11 May 2013 (UTC)[reply]