Home » Keyword index

removable edge


Graph Theory

3-Edge-Coloring Conjecture ★★★

Author(s): Arthur; Hoffmann-Ostenhof

Conjecture   Suppose $ G $ with $ |V(G)|>2 $ is a connected cubic graph admitting a $ 3 $-edge coloring. Then there is an edge $ e \in E(G) $ such that the cubic graph homeomorphic to $ G-e $ has a $ 3 $-edge coloring.

Keywords: 3-edge coloring; 4-flow; removable edge

Posted by arthur
updated June 23rd, 2022
4 comments
Syndicate content