In 1982, Zaslavsky introduced the concept of a proper vertex colouring of a signed graph G as a mapping φ : V (G) → Z such that for any two adjacent vertices u and v the colour φ(u) is different from the colour σ(uv)φ(v), where is σ(uv) is the sign of the edge uv. The substantial part of Zaslavsky's research concentrated on polynomial invariants related to signed graph colourings rather than on the behaviour of colourings of individual signed graphs. We continue the study of signed graph colourings by proposing the definition of a chromatic number for signed graphs which provides a natural extension of the chromatic number of an unsigned graph. We establish the basic properties of this invariant, provide bounds in terms of the chromatic number of the underlying unsigned graph, investigate the chromatic number of signed planar graphs, and prove an extension of the celebrated Brooks theorem to signed graphs.
We estimate the minimum number of vertices of a cubic graph with given oddness and cyclic connectivity. We prove that a bridgeless cubic graph G with oddness ω(G) other than the Petersen graph has at least 5.41 · ω(G) vertices, and for each integer k with 2 ≤ k ≤ 6 we construct an infinite family of cubic graphs with cyclic connectivity k and small oddness ratio |V (G)|/ω(G). In particular, for cyclic connectivity 2, 4, 5, and 6 we improve the upper bounds on the oddness ratio of snarks to 7.5, 13, 25, and 99 from the known values 9, 15, 76, and 118, respectively. In addition, we construct a cyclically 4-connected snark of girth 5 with oddness 4 on 44 vertices, improving the best previous value of 46.
Abstract:The Strong Circular 5-flow Conjecture of Mohar claims that each snark-with the sole exception of the Petersen graph-has circular flow number smaller than 5. We disprove this conjecture by constructing an infinite family of cyclically 4-edge connected snarks whose circular flow number equals 5.
We introduce the concept of a signed circuit cover of a signed graph. A signed circuit cover is a natural analog of a circuit cover of a graph and is equivalent to a covering of the corresponding signed graphic matroid with circuits. As in the case of graphs, a signed graph has a signed circuit cover only when it admits a nowhere‐zero integer flow. In the present article, we establish the existence of a universal coefficient q∈R such that every signed graph G that admits a nowhere‐zero integer flow has a signed circuit cover of total length at most q·|E(G)|. We show that if G is bridgeless, then q≤9, and in the general case q≤11.
A Fano colouring is a colouring of the edges of a cubic graph by points of the Fano plane such that the colours of any three mutually adjacent edges form a line of the Fano plane. It has recently been shown by Holroyd andŠkoviera (J. Combin. Theory Ser. B, to appear) that a cubic graph has a Fano colouring if and only if it is bridgeless. In this paper we prove that six, and conjecture that four, lines of the Fano plane are sufficient to colour any bridgeless cubic graph. We establish connections of our conjecture to other conjectures concerning bridgeless cubic graphs, in particular to the well-known conjecture of Fulkerson about the existence of a double covering by 1-factors in every bridgeless cubic graph.
This paper is devoted to a detailed study of nowhere-zero flows on signed eulerian graphs. We generalise the well-known fact about the existence of nowhere-zero 2flows in eulerian graphs by proving that every signed eulerian graph that admits an integer nowhere-zero flow has a nowhere-zero 4-flow. We also characterise signed eulerian graphs with flow number 2, 3, and 4, as well as those that do not have an integer nowhere-zero flow. Finally, we discuss the existence of nowhere-zero A-flows on signed eulerian graphs for an arbitrary abelian group A.
A snark is a "nontrivial" cubic graph whose edges cannot be properly coloured by three colours; it is irreducible if each nontrivial edge-cut divides the snark into colourable components. Irreducible snarks can be viewed as simplest uncolourable structures. In fact, all snarks can be composed from irreducible snarks in a suitable way. In this paper we deal with the problem of the existence of irreducible snarks of given order and cyclic connectivity. We determine all integers n for which there exists an irreducible snark of order n, and construct irreducible snarks with cyclic connectivity 4 and 5 of all possible orders. Moreover, we construct cyclically 6-connected irreducible snarks of each even order 210. (Cyclically 7-connected snarks are believed not to exist.)
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.