期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (3)
Let G(1), ...,G(n), be graphs on the same vertex set of size n, each graph with minimum degree delta(G(i)) >= n/2. A recent conjecture of Aharoni a......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (2)
A graph G is said to be (k, m)-choosable if for any assignment of k-element lists L-v subset of R to the vertices v is an element of V(G) and any assi......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (2)
A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with n......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (3)
We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the nat......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (2)
In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by v......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (2)
In 2019, Czabarka, Dankelmann and Szekely showed that for every undirected graph of order n, the minimum degree threshold for diameter two orientabili......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (3)
A finite subset X on the unit sphere S-d is called an s-distance set with strength t if its angle set A(X) := {< x, y > : x, y is an element of ......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (2)
Motivated by Stanley and Stembridge's conjecture about the e-positivity of claw-free incomparability graphs, Hamel and her collaborators studied the e......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (2)
The claw is the graph K-1,K-3, and the fork is the graph obtained from the claw K-1,K-3 by subdividing one of its edges once. In this paper, we prove ......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (2)
A signed graph is a pair (G; sigma), where G is a graph (loops and multi edges allowed) and sigma : E(G) -> {+, -} is a signature which assigns to ......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (1)
A mixed graph is a graph that can be obtained from a simple undirected graph by replacing some of the edges by arcs in precisely one of the two possib......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (1)
A signed circuit cover of a signed graph is a natural analog of a circuit cover of a graph, and is equivalent to a covering of its corresponding signe......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2021; 28 (1)
We give a characterization of the automorphism groups of connected prime-valent symmetric Cayley graphs on finite (non-abelian) simple groups.
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2020; 27 (2)
This paper determines all pairs (D,G) where D is a non-symmetric 2-(v, k, lambda) design with (r, lambda) = 1 and G is the almost simple flag-transiti......
期刊： ELECTRONIC JOURNAL OF COMBINATORICS, 2020; 27 (2)
Recently, perfect state transfer (PST for short) on graphs has attracted great attention due to their applications in quantum information processing a......
