Halin graph has been listed as one of the
Mathematics good articles under the
good article criteria. If you can improve it further,
please do so. If it no longer meets these criteria, you can
reassess it. Review: July 19, 2021. ( Reviewed version). |
A fact from Halin graph appeared on Wikipedia's
Main Page in the
Did you know column on 4 August 2021 (
check views). The text of the entry was as follows:
|
This article is rated GA-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
Hello,
This article, together with Wolfram and other sources, defines roofless polyhedron as a synonym for Halin Graph. However this book restricts the roofless polyhedra (aka based polyhedra) to the subclass of Halin graphs that are cubic.
Who is correct? -- MathsPoetry ( talk) 10:26, 12 January 2013 (UTC)
"for every edge in the graph, the removal of that edge reduces the connectivity of the graph". Why is this mentioned? Especially that being 3-vertex-connected is about connectivity when removing vertices, not edges. Was it Halin's point? If yes it should be mentioned, IMHO. -- MathsPoetry ( talk) 22:51, 13 January 2013 (UTC)
Maybe I did not search well, but I was unable to get a clear idea of what an "embedding" was, for example from the article about trees. Would it be possible to give a definition, a good internal link or a word of explanation? Sorry in advance if I missed some obvious solution. -- MathsPoetry ( talk) 21:45, 12 January 2013 (UTC)
An article in Wikipediocracy calls this article "semi-literate at best", and I can see what they mean: I had to read the first sentence a few times before I could make sense of it. I have boldly substituted a simpler wording. I hope it meets with approval. RockMagnetist ( talk) 23:25, 14 November 2013 (UTC)
I like the improvements by David Eppstein. I admit, I was a little timid in reducing the jargon, because this isn't my field. RockMagnetist ( talk) 02:06, 15 November 2013 (UTC)
In first section I read: "has at least four vertices" In section "Construction" I read: "with at least three vertices" I think second is wrong. Jumpow ( talk) 10:38, 21 December 2013 (UTC)Jumpow
Hello fellow Wikipedians,
I have just modified 2 external links on Halin graph. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
This message was posted before February 2018.
After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than
regular verification using the archive tool instructions below. Editors
have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the
RfC before doing mass systematic removals. This message is updated dynamically through the template {{
source check}}
(last update: 18 January 2022).
Cheers.— InternetArchiveBot ( Report bug) 10:38, 28 October 2017 (UTC)
GA toolbox |
---|
Reviewing |
Reviewer: Some Dude From North Carolina ( talk · contribs) 01:21, 18 July 2021 (UTC)
GA review (see here for what the criteria are, and here for what they are not) |
---|
|
Overall: |
· · · |
The result was: promoted by
Desertarun (
talk) 15:15, 1 August 2021 (UTC)
Improved to Good Article status by David Eppstein ( talk). Self-nominated at 00:39, 21 July 2021 (UTC).
General: Article is new enough and long enough |
---|
Policy: Article is sourced, neutral, and free of copyright problems |
---|
|
Hook: Hook has been verified by provided inline citation |
---|
|
QPQ: Done. |
Halin graph has been listed as one of the
Mathematics good articles under the
good article criteria. If you can improve it further,
please do so. If it no longer meets these criteria, you can
reassess it. Review: July 19, 2021. ( Reviewed version). |
A fact from Halin graph appeared on Wikipedia's
Main Page in the
Did you know column on 4 August 2021 (
check views). The text of the entry was as follows:
|
This article is rated GA-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
Hello,
This article, together with Wolfram and other sources, defines roofless polyhedron as a synonym for Halin Graph. However this book restricts the roofless polyhedra (aka based polyhedra) to the subclass of Halin graphs that are cubic.
Who is correct? -- MathsPoetry ( talk) 10:26, 12 January 2013 (UTC)
"for every edge in the graph, the removal of that edge reduces the connectivity of the graph". Why is this mentioned? Especially that being 3-vertex-connected is about connectivity when removing vertices, not edges. Was it Halin's point? If yes it should be mentioned, IMHO. -- MathsPoetry ( talk) 22:51, 13 January 2013 (UTC)
Maybe I did not search well, but I was unable to get a clear idea of what an "embedding" was, for example from the article about trees. Would it be possible to give a definition, a good internal link or a word of explanation? Sorry in advance if I missed some obvious solution. -- MathsPoetry ( talk) 21:45, 12 January 2013 (UTC)
An article in Wikipediocracy calls this article "semi-literate at best", and I can see what they mean: I had to read the first sentence a few times before I could make sense of it. I have boldly substituted a simpler wording. I hope it meets with approval. RockMagnetist ( talk) 23:25, 14 November 2013 (UTC)
I like the improvements by David Eppstein. I admit, I was a little timid in reducing the jargon, because this isn't my field. RockMagnetist ( talk) 02:06, 15 November 2013 (UTC)
In first section I read: "has at least four vertices" In section "Construction" I read: "with at least three vertices" I think second is wrong. Jumpow ( talk) 10:38, 21 December 2013 (UTC)Jumpow
Hello fellow Wikipedians,
I have just modified 2 external links on Halin graph. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
This message was posted before February 2018.
After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than
regular verification using the archive tool instructions below. Editors
have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the
RfC before doing mass systematic removals. This message is updated dynamically through the template {{
source check}}
(last update: 18 January 2022).
Cheers.— InternetArchiveBot ( Report bug) 10:38, 28 October 2017 (UTC)
GA toolbox |
---|
Reviewing |
Reviewer: Some Dude From North Carolina ( talk · contribs) 01:21, 18 July 2021 (UTC)
GA review (see here for what the criteria are, and here for what they are not) |
---|
|
Overall: |
· · · |
The result was: promoted by
Desertarun (
talk) 15:15, 1 August 2021 (UTC)
Improved to Good Article status by David Eppstein ( talk). Self-nominated at 00:39, 21 July 2021 (UTC).
General: Article is new enough and long enough |
---|
Policy: Article is sourced, neutral, and free of copyright problems |
---|
|
Hook: Hook has been verified by provided inline citation |
---|
|
QPQ: Done. |