The reducibility of optimal 1-planar graphs
About
A graph is reducible if it is the lexicographic product of two smaller non-trivial graphs. It is well-known a 1-planar graph with $n ~(\ge3)$ vertices has at most $4n-8$ edges, and a graph $G$ with $n$ vertices is optimal if $G$ has exactly $4n-8$ edges. In this paper, we characterize the reducibility of optimal 1-planar graphs. This work is motivated by a problem posed by Bucko and Czap in 2015, which concerns determining the 1-planarity of the lexicographic product of a graph and two isolated vertices.
Licheng Zhang, Yuanqiu Huang• 2022
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Multivariate long-term series forecasting | Weather (test) | -- | 269 | |
| Multivariate long-term series forecasting | Traffic (test) | -- | 219 | |
| Multivariate long-term series forecasting | ETTm2 (test) | -- | 150 | |
| Multivariate long-term forecasting | ETTm1 (test) | -- | 134 | |
| Multivariate long-term forecasting | ETTh1 (test) | -- | 77 | |
| Multivariate long-term forecasting | ETTh2 (test) | -- | 76 | |
| Long-term multivariate time series forecasting | Electricity (test) | MSE (H=96)0.129 | 3 |
Showing 7 of 7 rows