Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1208.4332

On Barnette's Conjecture and $H^{+-}$ property

Jan Florek
View original source ↗Read source document ↗Export metadata ↓

Abstract

A conjecture of Barnette states that every 3-connected cubic bipartite plane graph has a Hamilton cycle, which is equivalent to the statement that every simple even plane triangulation admits a partition of its vertex set into two subsets so that each induces a tree. Let $G$ be a simple even plane triangulation and suppose that ${V_1, V_2, V_3}$ is a 3-coloring of the vertex set of $G$. Let $B_{i}$, $i = 1, 2, 3$, be the set of all vertices in $V_i$ of the degree at least 6. We prove that if induced graphs $G[B_1 \cup B_2]$ and $G[B_1 \cup B_3]$ are acyclic, then the following properties are satisfied: [6pt] (1) For every path $abc$ there is possible to partition the vertex set of $G$ into two subsets so that each induces a tree, and one of them contains the edge $ab$ and avoids the vertex $c$, [6pt] (2) For every path $abc$ with vertices $a$, $c$ of the same color there is possible to partition the vertex set of $G$ into two subsets so that each induces a tree, and one of them contains the path $abc$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Florek. 2012-08-21. On Barnette's Conjecture and $H^{+-}$ property. https://arxiv.org/abs/1208.4332

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↗