Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903077 | Discrete Mathematics | 2018 | 10 Pages |
Abstract
We study the class of simple graphs Gâ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in Gâ and prove that every GâGâ satisfies the list-edge-coloring conjecture. When Î(G)â¥4, we in fact prove a stronger result about kernel-perfect orientations in L(G) which implies that G is (mÎ(G):m)-edge-choosable and Î(G)-edge-paintable for every mâ¥1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jessica McDonald, Gregory J. Puleo,