相关论文: Ban--Linial's Conjecture and treelike snarks
A hole is an induced cycle of length at least 4. Let $\l\ge 2$ be a positive integer, let ${\cal G}_l$ denote the family of graphs which have girth $2\l+1$ and have no holes of odd length at least $2\l+3$, and let $G\in {\cal G}_{\l}$. For…
Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each $k$, there is a finite obstruction set $\mathcal{O}_k$ of graphs such that…
The dichromatic number of a digraph $D$ is the minimum number of colors needed to color its vertices in such a way that each color class induces an acyclic digraph. As it generalizes the notion of the chromatic number of graphs, it has been…
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…
We introduce a family of graphs that generalises the class of Cayley graphs. For non-empty subsets L, R of a group G, the two-sided Cayley graph 2SC(G;L,R) is the directed graph with vertex set G and an arc from x to y if and only if…
Hadwiger's Conjecture states that every graph with chromatic number $k$ contains a complete graph on $k$ vertices as a minor. This conjecture is a tremendous strengthening of the Four-Colour Theorem and is regarded as one of the most…
A normal $k$-edge-coloring of a cubic graph is an edge-coloring with $k$ colors having the additional property that when looking at the set of colors assigned to any edge $e$ and the four edges adjacent it, we have either exactly five…
A graph with $v$ vertices is $(r)$-pancyclic if it contains precisely $r$ cycles of every length from 3 to $v$. A bipartite graph with even number of vertices $v$ is said to be $(r)$-bipancyclic if it contains precisely $r$ cycles of each…
A {\em brick} is a non-bipartite matching covered graph without non-trivial tight cuts. Bricks are building blocks of matching covered graphs. We say that an edge $e$ in a brick $G$ is {\em $b$-invariant} if $G-e$ is matching covered and a…
A strong edge coloring of a graph $G$ is a proper edge coloring in which each color class is an induced matching of $G$. In 1993, Brualdi and Quinn Massey proposed a conjecture that every bipartite graph without $4$-cycles and with the…
A total coloring of a graph colors all its elements, vertices and edges, with no adjacency conflicts. The Total Coloring Conjecture (TCC) is a sixty year old challenge, says that every graph admits a total coloring with at most maximum…
A graph $G$ is called an $[s,t]$-graph if any induced subgraph of $G$ of order $s$ has size at least $t$. In 2024, Zhan conjectured that every $2$-connected $[p + 2, p]$-graph of order at least $2p + 3$ and with minimum degree at least $p$…
A graph $G$ is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is the same for all 2-factors of $G$. Abreu et al. conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the only essentially…
For a given snark G and edge e of G, we can form a cubic graph G_e using an operation we call "edge subtraction". The number of 3-edge-colourings of G_e is 18 * \psi(G,e) for some nonnegative integer \psi(G,e). Given snarks G_1 and G_2, we…
The aim of this paper is to classify all snarks up to order $36$ and explain the reasons of their uncolourability. The crucial part of our approach is a computer-assisted structural analysis of cyclically $5$-connected critical snarks,…
A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…
A graph is apex if there is a vertex whose deletion makes the graph planar, and doublecross if it can be drawn in the plane with only two crossings, both incident with the infinite region in the natural sense. In 1966, Tutte conjectured…
If $f:\mathbb{N}\rightarrow \mathbb{N}$ is a function, then let us say that $f$ is sublinear if \[\lim_{n\rightarrow +\infty}\frac{f(n)}{n}=0.\] If $G=(V,E)$ is a cubic graph and $c:E\rightarrow \{1,...,k\}$ is a proper $k$-edge-coloring of…
For a given graph $R$, a graph $G$ is $R$-free if $G$ does not contain $R$ as an induced subgraph. It is known that every $2$-tough graph with at least three vertices has a $2$-factor. In graphs with restricted structures, it was shown that…
The Cycle double cover (CDC) conjecture states that for every bridgeless graph $G$, there exists a family $\mathcal{F}$ of cycles such that each edge of the graph is contained in exactly two members of $\mathcal{F}$. Given an embedding of a…