Saved in:
Bibliographic Details
Main Authors: Ding, Zongpeng, Huang, Yuanqiu, Dong, Fengming
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2404.09434
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • A graph $G$ is said to be crossing-critical if $cr(G-e)< cr(G)$ for every edge $e$ of $G$, where $cr(G)$ is the crossing number of $G$. Richter and Thomassen [Journal of Combinatorial Theory, Series B 58 (1993), 217-224] constructed an infinite family of 4-regular crossing-critical graphs with crossing number $3$. In this article, we present a new infinite family of 4-regular crossing-critical graphs.