Related papers: New constructions for the $n$-queens problem

We introduce a notion of ``$n$-dual'' to a simplicial vector space for $n\ge 0$. Coming with it, there is a canonical pairing, which we show to be non-degenerate up to homotopy for homotopy $n$-types. As a result this notion of duality is…

A colouring of a graph $G=(V,E)$ is a function $c: V\rightarrow\{1,2,\ldots \}$ such that $c(u)\neq c(v)$ for every $uv\in E$. A $k$-regular list assignment of $G$ is a function $L$ with domain $V$ such that for every $u\in V$, $L(u)$ is a…

We investigate several properties of Kronecker (direct, tensor) products of graphs that are planar and $3$-connected (polyhedral, $3$-polytopal). This class of graphs was recently characterised and constructed by the second author [15]. Our…

Daisy cubes are a recently introduced class of isometric subgraphs of hypercubes $Q_n$. They are induced with intervals between chosen vertices of $Q_n$ and the vertex $0^n\in V(Q_n)$. In this paper we characterize daisy cubes in terms of…

A $k$-regular graph on $v$ vertices is a {\em divisible design graph} if there exist integers $\lambda_1,\lambda_2,m,n$ such that the vertex set can be partitioned into $m$ classes of size $n$ and any two different vertices from the same…

A dominating set $D$ for a graph $G$ is a subset of $V(G)$ such that any vertex not in $D$ has at least one neighbor in $D$. The domination number $\gamma(G)$ is the size of a minimum dominating set in $G$. Vizing's conjecture from 1968…

A homomorphism from a graph $G$ to a graph $H$ is an edge-preserving mapping from $V(G)$ to $V(H)$. For a fixed graph $H$, in the list homomorphism problem, denoted by LHom($H$), we are given a graph $G$, whose every vertex $v$ is equipped…

Let $H$ be a Krull monoid with finite class group $G$ and suppose that every class contains a prime divisor. If an element $a \in H$ has a factorization $a=u_1 \cdot \ldots \cdot u_k$ into irreducible elements $u_1, \ldots, u_k \in H$, then…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

Given a graph G = (V,E), a subset S of V is dominating if for every v in V - S there exists u in S such that uv is in E. A dominating subset S of V is secure if for every v in V - S there exists u in S such that (S - {u}) U {v} is…

A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Let $\gamma(G)$ be the cardinality of a minimum dominating set in $G$. The bondage number $b(G)$ of a graph $G$ is the…

The Queen's Domination problem, studied for over 160 years, poses the following question: What is the least number of queens that can be arranged on a $m \times n$ chessboard so that they either attack or occupy every cell? We propose a…

Harary and Palmer announced an enumeration problem of labelled self-complementary graphs at the end of their book (Graphical Enumeration, Academic Press, New York and London, 1973). This paper resolves this problem. A method for solving…

A vertex $v$ of a graph $G=(V,E)$ is said to be undefended with respect to a function $f: V \longrightarrow \{0,1,2\}$ if $f(v)=0$ and $f(u)=0$ for every vertex $u$ adjacent to $v$. We call the function $f$ a weak Roman dominating function…

Given a digraph $G$, a set $X\subseteq V(G)$ is said to be absorbing set (resp. dominating set) if every vertex in the graph is either in $X$ or is an in-neighbour (resp. out-neighbour) of a vertex in $X$. A set $S\subseteq V(G)$ is said to…

The dominating set problem (DSP) is one of the most famous problems in combinatorial optimization. It is defined as follows. For a given simple graph $G=(V,E)$, a dominating set of $G$ is a subset $S\subseteq V$ such that every vertex in $…

For a simple algebraic group $G$ over an algebraically closed field, we study products of normal subsets. For this we mark the nodes of the Dynkin diagram of $G$. We use two types of labels, a binary marking and a labeling with non-negative…

A digraph D is the pattern of a matrix M when D has an arc ij if and only if the ij-th entry of M is nonzero. Study the relationship between unitary matrices and their patterns is motivated by works in quantum chaology and quantum…

Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…

We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, to obtain a bijection with a new class of labeled trees, which we call…