Analogues of the Shannon Capacity of a Graph

DOI10.1016/S0304-0208(08)73501-1MaRDI QIDQ3966167zbMATH OpenOpenAlexFDO

Authors Fred Roberts, Pavol Hell

Publication date 1982

Published in Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)73501-1

zbMATH Keywords

chromatic numberclique numberindependence numberKneser conjecturelexicographic productShannon capacitystrong product

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Cited in

(16)

• The independence number of the strong product of cycles
• On the chromatic number of the lexicographic product and the Cartesian sum of graphs
• The independence number of the strong product of odd cycles
• On the fractional chromatic number and the lexicographic product of graphs
• On the ultimate independence ratio of a graph
• On the ultimate normalized chromatic difference sequence of a graph
• Coloring graph products---a survey
• On the bounds for the ultimate independence ratio of a graph
• Chromatic difference sequences and homomorphisms
• Asymptotic values of the Hall-ratio for graph powers
• An Analogue of the Shannon Capacity of a Graph
• Chromatic numbers of the strong product of odd cycles
• scientific article; zbMATH DE number 2230321 (Why is no real title available?)
• Acyclic coloring of products of digraphs
• Colouring strong products
• Redundancy of codes with graph constraints

This page was built for publication: Analogues of the Shannon Capacity of a Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3966167)