Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Size of edge-critical uniquely 3-colorable planar graphs   A graph $G$ is \emph{uniquely k-colorable} if the chromatic number of $G$ is
$k$ and $G$ has only one $k$-coloring up to permutation of the colors. A
uniquely $k$-colorable graph $G$ is edge-critical if $G-e$ is not a uniquely
$k$-colorable graph for any edge $e\in E(G)$. Mel'nikov and Steinberg [L. S.
Mel'nikov, R. Steinberg, One counterexample for two conjectures on three
coloring, Discrete Math. 20 (1977) 203-206] asked to find an exact upper bound
for the number of edges in a edge-critical 3-colorable planar graph with $n$
vertices. In this paper, we give some properties of edge-critical uniquely
3-colorable planar graphs and prove that if $G$ is such a graph with $n(\geq6)$
vertices, then $|E(G)|\leq \frac{5}{2}n-6 $, which improves the upper bound
$\frac{8}{3}n-\frac{17}{3}$ given by Matsumoto [N. Matsumoto, The size of
edge-critical uniquely 3-colorable planar graphs, Electron. J. Combin. 20 (3)
(2013) $\#$P49]. Furthermore, we find some edge-critical 3-colorable planar
graphs which have $n(=10,12, 14)$ vertices and $\frac{5}{2}n-7$ edges.

32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph
23
The categories of this paper are: solv-int
4
The categories of this paper are: cond-mat
19
The categories of this paper are: eess
25
The categories of this paper are: patt-sol
24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat
7
The categories of this paper are: hep-th
33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
20
The categories of this paper are: acc-phys
5
The categories of this paper are: gr-qc
27
The categories of this paper are: comp-gas
30
The categories of this paper are: q-alg