Related papers: On finding hamiltonian cycles in Barnette graphs
The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of…
We give uniform, explicit, and simple face-pairing descriptions of all the branched cyclic covers of the 3-sphere, branched over two-bridge knots. Our method is to use the bi-twisted face-pairing constructions of Cannon, Floyd, and Parry;…
In 2007, Arkin et al. initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They…
A graph $G$ is called \emph{claw-o-heavy} if every induced claw ($K_{1,3}$) of $G$ has two end-vertices with degree sum at least $|V(G)|$ in $G$. For a given graph $R$, $G$ is called \emph{$R$-f-heavy} if for every induced subgraph $H$ of…
The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph $K_2$. $G$ is prism-hamiltonian if the prism over $G$ has a Hamilton cycle. A good even cactus is a connected graph in which every block is either an edge or…
We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…
Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…
A graph $ G $ is called $ t $-tough if $ \left|S\right|\geq t\cdot w\left(G-S\right)$ for every cutset $ S $ of $G$. Chv\'atal conjectured that there exists a constant $ t_{0} $ such that every $ t_{0} $-tough graph has a hamiltonian cycle.…
The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if…
A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic. In this work we present…
The \emph{prism} over a graph $G$ is the product $G \Box K_2$, i.e., the graph obtained by taking two copies of $G$ and adding a perfect matching joining the two copies of each vertex by an edge. The graph $G$ is called…
Let $S=\{K_{1,3},K_3,P_4\}$ be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph $G$ into graphs taken from any non-empty $S'\subseteq S$. The problem is known to be NP-complete for any…
We consider the algorithmic complexity of recognizing bipartite temporal graphs. Rather than defining these graphs solely by their underlying graph or individual layers, we define a bipartite temporal graph as one in which every layer can…
Cubicity of a graph $G$ is the smallest dimension $d$, for which $G$ is a unit disc graph in ${\mathbb{R}}^d$, under the $l^\infty$ metric, i.e. $G$ can be represented as an intersection graph of $d$-dimensional (axis-parallel) unit…
We consider the problem of constructing an abstract $(n+1)$-polytope $Q$ with $k$ facets isomorphic to a given $n$-polytope $P$, where $k \geq 3$. In particular, we consider the case where we want $Q$ to be $(n-2,n)$-flat, meaning that…
Let $G$ be an $r$-partite graph such that the edge density between any two parts is at least $\alpha$. How large does $\alpha$ need to be to guarantee that $G$ contains a connected transversal, that is, a tree on $r$ vertices meeting each…
A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
Let $G$ be a bridgeless cubic graph. In 2023, the three authors solved a conjecture (also known as the $S_4$-Conjecture) made by Mazzuoccolo in 2013: there exist two perfect matchings of $G$ such that the complement of their union is a…
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…