Abstract
Given a 3-colorable graph , the 3-coloring complex is the graph whose vertices are all the independent sets which occur as color classes in some 3-coloring of . Two color classes are joined by an edge if and appear together in a 3-coloring of . The graph is 3-colorable. Graphs for which is isomorphic to 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.