The Star and Biclique Coloring and Choosability Problems
From MaRDI portal
Publication:5494862
DOI10.7155/jgaa.00326zbMath1295.05106arXiv1210.7269OpenAlexW2142109806MaRDI QIDQ5494862
Marina Groshaus, Pablo Terlisky, Francisco J. Soulignac
Publication date: 30 July 2014
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7269
Related Items
Complexity-separating graph classes for vertex, edge and total colouring, Intersection graph of maximal stars, On star and biclique edge-colorings, Biclique-colouring verification complexity and biclique-colouring power graphs, Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs