Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.12491

On the minimum vertex cover of snarks

Gustavo Fernandes·Atílio G. Luiz
View original source ↗Read source document ↗Export metadata ↓

Abstract

A vertex cover of a graph $G$ is a subset of vertices $C \subseteq V(G)$ such that every edge of $G$ is incident to at least one vertex in $C$. The vertex cover number of $G$ is the minimum cardinality of a vertex cover of $G$ and is denoted by $τ(G)$. A snark is a connected, bridgeless, cubic graph that has an edge chromatic number of four, meaning its edges cannot be properly colored with only three colors. In this work, we investigate the problem of determining the value of a minimum vertex cover for classes of snark graphs. Given a positive integer $k$, we firstly prove that determining whether an arbitrary snark has a vertex cover $C$ with size $|C| \leq k$ is an NP-complete problem. Secondly, we determine the vertex cover number $τ(G)$ for several subclasses of snark graphs, such as Flower snarks, Goldberg snarks, Generalized Blanuša snarks and Loupekine snarks.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gustavo Fernandes, Atílio G. Luiz. 2026-08-12. On the minimum vertex cover of snarks. https://arxiv.org/abs/2608.12491

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗