Linear forest: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

9 February 2025

  • curprev 03:2103:21, 9 February 2025 imported>David Eppstein 8,426 bytes +8,426 You do know that claw-free graph has a specific meaning that you could learn by reading the linked article? It means there is no K_{1,3} as an induced subgraph, not necessarily a component. If you have a vertex of degree ≥ 3, then either it and some two of its neighbors induce a triangle or it and any three of its neighbors induce a claw. And if all degrees ≤ 2 then either it is a linear forest or there is a cycle. So it is indeed equivalent. What was the star for?
Retrieved from "https://en.wiki.beta.math.wmflabs.org/wiki/Linear_forest"