Abstract
AbstractA biclique of G is a maximal set of vertices that induces a complete bipartite subgraph of G with at least one edge, and a star of a graph G is a maximal set of vertices that induces a complete bipartite graph . A biclique (resp. star) edge‐coloring is a coloring of the edges of a graph with no monochromatic bicliques (resp. stars). We prove that the problem of determining whether a graph G has a biclique (resp. star) edge‐coloring using two colors is NP‐hard. Furthermore, we describe polynomial time algorithms for the problem in restricted classes: K3‐free graphs, chordal bipartite graphs, powers of paths, and powers of cycles.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Transactions in Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
