Related papers: 4-colored graphs and knot/link complements
The goal of this book is to characterize algebraically the closed 4-manifolds that fibre nontrivially or admit geometries in the sense of Thurston, or which are obtained by surgery on 2-knots, and to provide a reference for the topology of…
In this work we present a complete (no misses, no duplicates) census for closed, connected, orientable and prime 3-manifolds induced by plane graphs with a bipartition of its edge set (blinks) up to $k=9$ edges. Blinks form a universal…
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…
We prove that there are compact submanifolds of the 3-sphere whose interiors are not homeomorphic to any geometric limit of hyperbolic knot complements.
We conjecture that every graph of minimum degree five with no separating triangles and drawn in the plane with one crossing is 4-colorable. In this paper, we use computer enumeration to show that this conjecture holds for all graphs with at…
Gems are a particular type of edge-colored graphs, dual to colored triangulations, which represent compact PL-manifolds of arbitrary dimension, both in the closed and boundary case. In the present paper, gem theory is used to approach…
It is natural to ask how many isotopy classes of embedded essential surfaces lie in a given 3-manifold. The first bounds on the number of such surfaces were exponential, using normal surfaces. More recently, by restricting to alternating…
A combinatorial presentation of closed orientable 3-manifolds as bi-tricolored links is given together with two versions of a calculus via moves to manipulate bi-tricolored links without changing the represented manifold. That is, we…
In 1972, Mader showed that every graph without a 3-connected subgraph is 4-degenerate and thus 5-colorable}. We show that the number 5 of colors can be replaced by 4, which is best possible.
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
Among graphs with 13 edges, there are exactly three internally 4-connected graphs which are $Oct^{+}$, cube+e and $ K_{3,3} +v$. A complete characterization of all 4-connected graphs with no $Oct^{+}$-minor is given in [John Maharry, An…
In this article, we propose a new approach for describing and understanding knots and links in a 3-manifold through the use of an embedded non-orientable surface. Specifically, we define a plat-like representation based on this…
This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…
In this paper we study colored triangulations of compact PL 4-manifolds with empty or connected boundary which induce handle decompositions lacking in 1-handles or in 1- and 3-handles, thus facing also the problem, posed by Kirby, of the…
Examples are given to show that some compact contractible 4-manifolds can be knotted in the 4-sphere. It is then proved that any finitely presented perfect group with a balanced presentation is a knot group for an embedding of some…
We give an exact characterization of 3-colorability of triangle-free graphs drawn in the torus, in the form of 186 "templates" (graphs with certain faces filled by arbitrary quadrangulations) such that a graph from this class is not…
Relative self-linking and linking "numbers" for pairs of knots in oriented 3-manifolds are defined in terms of intersection invariants of immersed surfaces in 4-manifolds. The resulting concordance invariants generalize the usual…
It is proved that every connected graph $G$ on $n$ vertices with $\chi(G) \geq 4$ has at most $k(k-1)^{n-3}(k-2)(k-3)$ $k$-colourings for every $k \geq 4$. Equality holds for some (and then for every) $k$ if and only if the graph is formed…
We show that any orientation of a graph with maximum degree three has an oriented 9-colouring, and that any orientation of a graph with maximum degree four has an oriented 69-colouring. These results improve the best known upper bounds of…
Maximal planar graph refers to the planar graph with the most edges, which means no more edges can be added so that the resulting graph is still planar. The Four-Color Conjecture says that every planar graph without loops is 4-colorable.…