Papers
Topics
Authors
Recent
Search
2000 character limit reached

Non-conflicting no-where zero $Z_2\times Z_2$ flows in cubic graphs

Published 6 Oct 2024 in math.CO and cs.DM | (2410.04389v1)

Abstract: Let $Z_2\times Z_2={0, \alpha, \beta, \alpha+\beta}$. If $G$ is a bridgeless cubic graph, $F$ is a perfect matching of $G$ and $\overline{F}$ is the complementary 2-factor of $F$, then a no-where zero $Z_2\times Z_2$-flow $\theta$ of $G/\overline{F}$ is called non-conflicting with respect to $\overline{F}$, if $\overline{F}$ contains no edge $e=uv$, such that $u$ is incident to an edge with $\theta$-value $\alpha$ and $v$ is incident to an edge with $\theta$-value $\beta$. In this paper, we demonstrate the usefulness of non-conflicting flows by showing that if a cubic graph $G$ admits such a flow with respect to some perfect matching $F$, then $G$ admits a normal 6-edge-coloring. We use this observation in order to show that claw-free bridgeless cubic graphs, bridgeless cubic graphs possessing a 2-factor having at most two cycles admit a normal 6-edge-coloring. We demonstrate the usefulness of non-conflicting flows further by relating them to a recent conjecture of Thomassen about edge-disjoint perfect matchings in highly connected regular graphs. In the end of the paper, we construct infinitely many 2-edge-connected cubic graphs such that $G/\overline{F}$ does not admit a non-conflicting no-where zero $Z_2\times Z_2$-flow with respect to any perfect matching $F$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.