A358316 Number of edge-4-critical graphs on n unlabeled vertices.

1, 0, 1, 2, 5, 21, 150, 1221, 14581, 207969

Offset

4,4

Comments

An undirected simple graph G is edge-4-critical if it is connected, is not (vertex) 3-colorable, and G-e is 3-colorable for every edge e.

Links

Table of n, a(n) for n=4..13.

Brendan McKay, Graphs.

Crossrefs

Sequence in context: A180998 A144271 A193189 * A176527 A117261 A108021

Adjacent sequences: A358313 A358314 A358315 * A358317 A358318 A358319

Keyword

nonn,more

Author

Brendan McKay, Nov 08 2022

Status

approved