Recommendations
Cites work
- A branch‐and‐price approach to k‐clustering minimum biclique completion problem
- A result on the total colouring of powers of cycles
- Biclique completion problems for multicast network design
- Biclique-colouring verification complexity and biclique-colouring power graphs
- Clique-colouring and biclique-colouring unichord-free graphs
- Colouring vertices of triangle-free graphs without forests
- Complexity of clique coloring and related problems
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- The 1,2-conjecture for powers of cycles
- The Star and Biclique Coloring and Choosability Problems
Cited in
(13)- On the complexity of coloring ‐graphs
- Reinforcement learning-enhanced variable neighborhood search strategies for the k-clustering minimum biclique completion problem
- Chromatic characterization of biclique covers
- Edge-colorings avoiding fixed rainbow stars
- On the complexity of bicoloring clique hypergraphs of graphs
- scientific article; zbMATH DE number 1445283 (Why is no real title available?)
- On restricted edge-colorings of bicliques
- The Star and Biclique Coloring and Choosability Problems
- Exact algorithms for biclique coloring
- A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
- Intersection graph of maximal stars
- scientific article; zbMATH DE number 6178423 (Why is no real title available?)
- Biclique graphs of split graphs
This page was built for publication: On star and biclique edge-colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968507)
