Related papers: On factorisations of complete graphs into circulan…
Motivated to find the answers to some of the questions that have occurred in recent papers dealing with Hamiltonian cycles (abbreviated HCs) in some special classes of grid graphs we started the investigation of spanning unions of cycles,…
Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…
We present a new way to factor the dirichlet convolution for completely multiplicative functions whitch led us to constructing a ring that arise from the operations involved in the factorisation. We will conclude by some identities that was…
We study the perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a flip operation exchanges the edges in an alternating cycle of…
Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…
We study $2k$-factors in $(2r+1)$-regular graphs. Hanson, Loten, and Toft proved that every $(2r+1)$-regular graph with at most $2r$ cut-edges has a $2$-factor. We generalize their result by proving for $k\le(2r+1)/3$ that every…
The Hamilton-Waterloo problem asks for which $s$ and $r$ the complete graph $K_n$ can be decomposed into $s$ copies of a given 2-factor $F_1$ and $r$ copies of a given 2-factor $F_2$ (and one copy of a 1-factor if $n$ is even). In this…
It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an…
Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle…
A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-factor-critical graphs and 2-factor-critical graphs are…
We present new generalizations of Olson's theorem and of a consequence of Alon's Combinatorial Nullstellensatz. These enable us to extend some of their combinatorial applications with conditions modulo primes to conditions modulo prime…
We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The resulting asymptotic behaviour is seen to generalise the…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
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…
We continue the analysis of the Modular Isomorphism Problem for $2$-generated $p$-groups with cyclic derived subgroup, $p>2$, started in [D. Garc\'ia-Lucas, \'A. del R\'io, and M. Stanojkovski. On group invariants determined by modular…
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…
Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…
We continue research into a well-studied family of problems that ask whether the vertices of a graph can be partitioned into sets $A$ and~$B$, where $A$ is an independent set and $B$ induces a graph from some specified graph class ${\cal…
A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs,…