|
|
A358316
|
|
Number of edge-4-critical graphs on n unlabeled vertices.
|
|
0
|
|
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|