Distance-2 Edge Coloring is NP-Complete
Jeff Erickson, Shripad Thite, David P. Bunde
Abstract
We prove that it is NP-complete to determine whether there exists a distance-2 edge coloring (strong edge coloring) with 5 colors of a bipartite 2-inductive graph with girth 6 and maximum degree 3.
Create a lesson
Related papers
Equitable Subpartitionability Does Not Characterize Box-TDI Polyhedra
Emiliano Lancini, Francesco Pisanu
Detection and Construction of Small Blocking Sets via Critical Independent Sets and Matching Decomposition
Quanlong Niu, Riheng Jia
Maximal Linear Arrangement is NP complete on Bipartite Graphs
Aparna Das, Jonathan Needleman
Counting Polyominoes, Revisited: Corrigendum and Addendum
Gill Barequet, Gil Ben-Shachar
Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation
Anand Babu N B, Ashwin Jacob, Manjusha M S et al.
An upper bound of 4.268 for the random 3-SAT satisfiability threshold
Fedor Vorobyev