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

preprint2020arXivOpen access

Abstract

Given a 3-colorable graph XX, the 3-coloring complex B(X)B(X) is the graph whose vertices are all the independent sets which occur as color classes in some 3-coloring of XX. Two color classes C,D∈V(B(X))C,D \in V(B(X)) are joined by an edge if CC and DD appear together in a 3-coloring of XX. The graph B(X)B(X) is 3-colorable. Graphs for which B(B(X))B(B(X)) is isomorphic to XX 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.