Template:Did you know nominations/Halin graph: Difference between revisions
Content deleted Content added
New DYK nom |
Reviewing DYK nomination |
||
| Line 19: | Line 19: | ||
--> |
--> |
||
:* {{DYK checklist |
|||
:* <!-- REPLACE THIS LINE TO WRITE FIRST COMMENT, KEEPING :* --> |
|||
|newness = y |
|||
|length = y |
|||
|eligibilityother = |
|||
|sourced = y |
|||
|neutral = y |
|||
|plagiarismfree = y |
|||
|policyother = |
|||
|hookcited = y |
|||
|hookinterest = y |
|||
|hookother = |
|||
|picfree = |
|||
|picused = |
|||
|picclear = |
|||
|qpq = y |
|||
|status = y |
|||
|comments = Long enough, new enough, well sourced, neutral, no copyvio. Both the hook and the article itself are really interesting. Ready to go! |
|||
|sign = [[User:Zin Win Hlaing|Zin Win Hlaing]] ([[User talk:Zin Win Hlaing|talk]]) 04:09, 24 July 2021 (UTC) |
|||
}} |
|||
}}<!--Please do not write below this line or remove this line. Place comments above this line.--> |
}}<!--Please do not write below this line or remove this line. Place comments above this line.--> |
||
Revision as of 04:10, 24 July 2021
| DYK toolbox |
|---|
Halin graph
- ... that when a tree is a star, connecting its leaves in a cycle makes a wheel? Source: Cornuéjols et al (1983), Halin graphs and the travelling salesman problem: "If T is a star, i.e., a single node v joined to n other nodes, then H is called a wheel and is the simplest type of Halin graph."
- ALT1:... that many hard combinatorial optimization problems are easier on Halin graphs because of their low treewidth? Source: Bodlaender (1988), Dynamic programming on graphs with bounded treewidth: "we show for a large number of graph decision problems ... the existence of O(n^C) or polynomial algorithms for these problems, restricted to the graphs with bounded treewidth"
- Reviewed: Sacred Heart of Jesus (Batoni)
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. |
Overall: 
Long enough, new enough, well sourced, neutral, no copyvio. Both the hook and the article itself are really interesting. Ready to go! Zin Win Hlaing (talk) 04:09, 24 July 2021 (UTC)