Clique, chromatic, and Lovász numbers of certain circulant graphs
From MaRDI portal
Publication:3439129
DOI10.1016/J.ENDM.2004.03.022zbMATH Open1152.05352OpenAlexW2013881994MaRDI QIDQ3439129FDOQ3439129
Authors: Valentin E. Brimkov 
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.022
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- On the Shannon capacity of a graph
- A Combinatorial Problem Related to Multimodule Memory Organizations
- The sandwich theorem
- Lower bounds for the clique and the chromatic numbers of a graph
- Randomized graph products, chromatic numbers, and Lovasz j-function
- Optimal distance networks of low degree for parallel computers
- Title not available (Why is that?)
- Spirograph Theory: A Framework for Calculations on Digitized Straight Lines
- Codes over tori
Cited In (10)
- Vertex-colouring of 3-chromatic circulant graphs
- All normalized anti-monotonic overlap graph measures are bounded
- On the clique behavior of circulants with three small jumps
- Title not available (Why is that?)
- Gap, cosum and product properties of the \(\theta ^{\prime}\) bound on the clique number
- Colouring clique-hypergraphs of circulant graphs
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs
- On Cliques and Clique Chromatic Numbers in Line, Lict and Lictact Graphs
- Hardness of computing clique number and chromatic number for Cayley graphs
- Exact Formulae for the Lovász Theta Function of Sparse Circulant Graphs
Uses Software
This page was built for publication: Clique, chromatic, and Lovász numbers of certain circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439129)
