arXiv Analytics

Sign in

arXiv:2004.06788 [math.CO]AbstractReferencesReviewsResources

Reflexive coloring complexes for 3-edge-colorings of cubic graphs

Fiachra Knox, Bojan Mohar, Nathan Singer

Published 2020-04-14Version 1

Given a 3-colorable graph $X$, the 3-coloring complex $B(X)$ is the graph whose vertices are all the independent sets which occur as color classes in some 3-coloring of $X$. Two color classes $C,D \in V(B(X))$ are joined by an edge if $C$ and $D$ appear together in a 3-coloring of $X$. The graph $B(X)$ is 3-colorable. Graphs for which $B(B(X))$ is isomorphic to $X$ are termed reflexive graphs. In this paper, we consider 3-edge-colorings of cubic graphs for which we allow half-edges. Then we consider the 3-coloring complexes of their line graphs. The main result of the paper is a surprising outcome that the line graph of any connected cubic triangle-free outerplanar graph is reflexive. We also exhibit some other interesting classes of reflexive line graphs.

Related articles: Most relevant | Search more
arXiv:1702.07156 [math.CO] (Published 2017-02-23)
On measures of edge-uncolorability of cubic graphs: A brief survey and some new results
arXiv:1211.1306 [math.CO] (Published 2012-11-06, updated 2013-08-28)
Delay colourings of cubic graphs
arXiv:0901.3894 [math.CO] (Published 2009-01-25)
An improved linear bound on the number of perfect matchings in cubic graphs