Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleMarch 2017
Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs
The class of unichord-free graphs was recently investigated in the context of vertex-colouring (Trotignon and Vušković in J Graph Theory 63(1): 31---67, 2010), edge-colouring (Machado et al. in Theor Comput Sci 411(7---9): 1221---1234, 2010) and total-...
- research-articleMarch 2016
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
Theoretical Computer Science (TCSC), Volume 618, Issue CPages 122–134https://doi.org/10.1016/j.tcs.2016.01.027A clique of a graph is a maximal set of vertices of size at least 2 that induces a complete graph. A k-clique-colouring of a graph is a colouring of the vertices with at most k colours such that no clique is monochromatic. Défossez proved that the 2-...
- articleNovember 2013
Colouring Clique-Hypergraphs of Circulant Graphs
Graphs and Combinatorics (GCOM), Volume 29, Issue 6Pages 1713–1720https://doi.org/10.1007/s00373-012-1241-4A clique-colouring of a graph G is a colouring of the vertices of G so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $${\mathcal{H}(G)}$$ , of a graph G has V ( G ) as its set of vertices and the maximal cliques of G as its ...