Colouring clique-hypergraphs of circulant graphs
From MaRDI portal
Publication:5900086
DOI10.1016/j.endm.2008.01.033zbMath1341.05065OpenAlexW2596432422MaRDI QIDQ5900086
Célia Picinin de Mello, C. N. Campos, Simone Dantas
Publication date: 5 June 2008
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.033
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (11)
Structural parameterizations of clique coloring ⋮ Clique-coloring claw-free graphs ⋮ More Results on Clique-chromatic Numbers of Graphs with No Long Path ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ Clique colourings of geometric graphs ⋮ Partitioning a graph into convex sets ⋮ Unnamed Item ⋮ Graphs with large clique-chromatic numbers ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs ⋮ A linear-time algorithm for clique-coloring planar graphs ⋮ The clique-perfectness and clique-coloring of outer-planar graphs
Cites Work
- A result on the total colouring of powers of cycles
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- Two-colouring all two-element maximal antichains
- LexBFS-orderings and powers of chordal graphs
- On planarity and colorability of circulant graphs
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Minimum chromaticity of circulant graphs
- Coloring the Maximal Cliques of Graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- Sur le coloriage des graphs
This page was built for publication: Colouring clique-hypergraphs of circulant graphs
