Related papers: 4-colored graphs and knot/link complements
Duffy et al. [C. Duffy, G. MacGillivray, and \'E. Sopena, Oriented colourings of graphs with maximum degree three and four, Discrete Mathematics, 342(4), p. 959--974, 2019] recently considered the oriented chromatic number of connected…
In this paper we have shown without assuming the four color theorem of planar graphs that every (bridgeless) cubic planar graph has a three-edge-coloring. This is an old-conjecture due to Tait in the squeal of efforts in settling the…
A \emph{unichord} in a graph is an edge that is the unique chord of a cycle. A \emph{square} is an induced cycle on four vertices. A graph is \emph{unichord-free} if none of its edges is a unichord. We give a slight restatement of a known…
We prove that every cyclically 4-edge-connected cubic graph that can be embedded in the torus, with the exceptional graph class called "Petersen-like", is 3-edge-colorable. This means every (non-trivial) toroidal snark can be obtained from…
The $3$-colorability problem is a well-known NP-complete problem and it remains NP-complete for $(claw, diamond, K_4)$-free graphs. Recently, $3$-colorability has been also considered for $(claw, N_{1,1,1})$-free graphs. Here, a generalised…
It is known that every loopless cubic graph is 4-edge choosable. We prove the following strengthened result. Let G be a planar cubic graph having b cut-edges. There exists a set F of at most 5b/2 edges of G with the following property. For…
A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. A full house is a graph composed by a vertex adjacent to both ends of an edge in $K_4$ . Let $H$ be the complement of a cycle on 7 vertices.…
This paper starts a systematic description of colored knot polynomials, beginning from the first non-(anti)symmetric representation R=[2,1]. The project involves several steps: (i) parametrization of big families of knots a la…
We introduce and explore the relation between quivers and 3-manifolds with the topology of the knot complement. This idea can be viewed as an adaptation of the knots-quivers correspondence to Gukov-Manolescu invariants of knot complements…
A balanced edge-coloring of the complete graph is an edge-coloring such that every vertex is incident to each color the same number of times. In this short note, we present a construction of a balanced edge-coloring with six colors of the…
In the prequel of this paper, Kauffman and Ogasa introduced new topological quantum invariants of compact oriented 3-manifolds with boundary where the boundary is a disjoint union of two identical surfaces. The invariants are constructed…
We introduce a new and rich class of graph coloring manifolds via the Hom complex construction of Lovasz. The class comprises examples of Stiefel manifolds, series of spheres and products of spheres, cubical surfaces, as well as examples of…
An edge-coloring of the complete graph $K_n$ we call $F$-caring if it leaves no $F$-subgraph of $K_n$ monochromatic and at the same time every subset of $|V(F)|$ vertices contains in it at least one completely multicolored version of $F$.…
We give superexponential lower and upper bounds on the number of coloured $d$-dimensional triangulations whose underlying space is an oriented manifold, when the number of simplices goes to infinity and $d\geq 3$ is fixed. In the special…
The sphere graph of $M_r$, a connect sum of $r$ copies of $S^1\times S^2$ was introduced by Hatcher as an analog of the curve graph of a surface to study the outer automorphism group of a free group $F_r$. Bestvina, Bromberg, and Fujiwara…
A 4-manifold is constructed with some curious metric properties; or maybe it is many 4-manifolds masquerading as one, which would explain why it looks curious. Anyway, knots in the 3-sphere with complete finite volume hyperbolic metrics on…
Gy\'arf\'as famously showed that in every $r$-coloring of the edges of the complete graph $K_n$, there is a monochromatic connected component with at least $\frac{n}{r-1}$ vertices. A recent line of study by Conlon, Tyomkyn, and the second…
We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…
We consider the number of colors for the colorings of links by the symmetric group $S_3$ of degree $3$. For knots, such a coloring corresponds to a Fox 3-coloring, and thus the number of colors must be 1 or 3. However, for links, there are…
Let $K_4^+$ be the 5-vertex graph obtained from $K_4$, the complete graph on four vertices, by subdividing one edge precisely once (i.e. by replacing one edge by a path on three vertices). We prove that if the chromatic number of some graph…