reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
J. Chlebı́ková, <a href="https://doi.org/10.1016/S0166-218X(01)00281-5">The Structure of Obstructions to Treewidth and Pathwidth</a>. Disc. Appl. Math., Vol. 120, no. 1-3 (2002), 61-71.
J. Chlebı́ková, <a href="https://doi.org/10.1016/S0166-218X(01)00281-5">The Structure of Obstructions to Treewidth and Pathwidth</a>. Disc. Appl. Math., Vol. 120, no. 1-3 (2002), 61-71.
proposed
editing
editing
proposed
Number of graphs with n vertices of treewidth n-2. Reason: The complement of a graph with n vertices and treewidth >= n-2 cannot have P3 or K3 as a subgraph (Chlebı́ková 2002, Theorem 10), so every component of it is a star. - Martín Muñoz, Dec 31 2023
J. Chlebı́ková, <a href="https://doi.org/10.1016/S0166-218X(01)00281-5">The Structure of Obstructions to Treewidth and Pathwidth</a>. Disc. Appl. Math., Vol. 120, no. 1-3 (2002), 61-71.
approved
editing
proposed
approved
editing
proposed
N. J. A. Sloane and Vincenzo Librandi, <a href="/A000065/b000065.txt">Table of n, a(n) for n = 0..1000</a> (first 199 terms from N. J. A. Sloane)
approved
editing
(MAGMAMagma) [NumberOfPartitions(n)-1: n in [0..50]]; // Vincenzo Librandi, Aug 25 2013