Projectivity and independent sets in powers of graphs

Authors:
Benoit Larose;Claude Tardif
Affiliations:
Champlain Regional College and Concordia University, Department of Mathematics and Statistics, Concordia University, 1455 DE Maisonneuve West, Montréal QC H3G 1M8, Canada;Department of Mathematics and Statistics, University of Regina, Regina SK S4S OA2, Canada
Venue:
Journal of Graph Theory
Year:
2002

Citing 0
Cited 5

Stable sets of maximal size in Kneser-type graphs

European Journal of Combinatorics
The k-independence number of direct products of graphs and Hedetniemi's conjecture

European Journal of Combinatorics
Independent sets in direct products of vertex-transitive graphs

Journal of Combinatorial Theory Series B
Survey: Colouring, constraint satisfaction, and complexity

Computer Science Review
Weak near-unanimity functions and digraph homomorphism problems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the relationship between projectivity and the structure of maximal independent sets in powers of circular graphs, Kneser graphs and truncated simplices. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 162–171, 2002