Circulants and sequences

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 2, 1998, Pages 330-339

  Collins, Karen L ^a  

^a WESLEYAN UNIVERSITY   (United States)

Author keywords

Cayley graph; Chromatic difference sequence; Circulant; Graph homomorphism; Independence ratio; No homomorphism lemma; Partitionable graph

Indexed keywords

EID: 1842653665     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480193252136     Document Type: Article

References (31)

1. M. O. ALBERTSON AND D. M. BERMAN, The chromatic difference sequence of a graph, J. Combin. Theory Ser. B, 29 (1980), pp. 1-12.
2. M. O. ALBERTSON AND D. M. HERMAN, Critical graphs for chromatic difference sequences, Discrete Math., 31 (1980), pp. 225-233.
3. M. O. ALBERTSON, L. CHAN, AND R. HAAS, Independence and graph homomorphisms, J. Graph Theory, 17 (1993), pp. 581-588.
4. M. O. ALBERTSON AND K. L. COLLINS, Homomorphisms of 3-chromatic graphs, Discrete Math., 54 (1985), pp. 127-132.
5. J. A. BONDY AND P. HELL, A note on the star chromatic number, J. Graph Theory, 14 (1990), pp. 479-482.
6. V. CHVÁTAL, R. L. GRAHAM, A. F. PEROLD, AND S. H. WHITESIDES, Combinatorial designs related to the strong perfect graph conjecture, Discrete Math., 26 (1979), pp. 83-92.
7. R. J. FAUDREE, R. J. GOULD, M. S. JACOBSON, AND R. H. SCHELP, Seymour's conjecture, in Advances in Graph Theory, V. R. Kulli, ed., Vishwa International Pub., Gulbarga, 1991, pp. 163-171.
8. S. V. FOMIN, Finite partially ordered sets and Young tableaux, Soviet Math. Dokl., 19 (1978), pp. 1510-1514 (in English).
9. S. V. FOMIN, A duality theorem for partially ordered sets: Algorithms, in Mathematical Methods for Constructing and Analyzing Algorithms 237, Nauka, Leningrad, 1990, pp. 190-199.
10. C. GREENE AND D. G. KLEITMAN, The structure of Sperner k-families, J. Combin. Theory Ser. A, 20 (1976), pp. 41-68.
11. C. GREENE, Some partitions associated with a partially ordered set, J. Combin. Theory Ser. A, 20 (1976), pp. 69-79.
12. R. HÄGGKVIST, Odd cycles of specified lengths in non-bipartite graphs, Ann. Discrete Math., 13 (1982), pp. 89-100.
13. G. HAHN, P. HELL, AND S. POLJAK, On the ultimate independence ratio of a graph, European J. Combin., 16 (1995), pp. 253-261.
14. G. HAHN AND J. SIRAN, A note on intersecting cliques in Cayley graphs, J. Combin. Math. Combin. Comput., 18 (1995), pp. 57-63.
15. P. HELL AND J. NESETRIL, On the complexity of H-coloring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
16. P. HELL, J. NESETRIL, AND X. ZHU, Complexity of tree homomorphisms, Discrete Appl. Math., 70 (1996), pp. 23-36.
17. P. HELL, J. NESETRIL, AND X. ZHU, Duality and polynomial testing of tree homomorphisms, Trans. Amer. Math. Soc., 348 (1996), pp. 1281-1297.
18. P. HELL, J. NESETRIL, AND X. ZHU, Duality of graph homomorphisms, in Combinatorics: Paul Erdos is Eighty, Bolyai Society Mathematical Studies, vol. 2, Jânos Bolyai Math. Soc., Budapest, 1996, pp. 271-282.
19. P. HELL, X. Yu, AND H. ZHOU, Independence of graph powers, Discrete Math., 127 (1994), pp. 213-220.
20. P. HELL AND X. ZHU, The existence of homomorphisms to oriented cycles, SIAM J. Discrete Math., 8 (1995), pp. 208-222.
21. P. HELL AND X. ZHU, Homomorphisms to oriented paths, Discrete Math., 132 (1994) pp. 107-114.
22. A. HOFFMAN AND D. SCHWARTZ, On partitions of a partially ordered set, J. Combin. Theory Ser. B, 23 (1977), pp. 3-13.
23. B. LAROSE, F. LAVIOLETTE, AND C. TARDIF, On normal Cayley graphs and hom-idempotent graphs, European J. Combin., to appear.
24. M. SAKS, A short proof of the existence of k-saturated partitions of a partially ordered set, Adv. Math., 33 (1979), pp. 207-211.
25. M. SAKS, Some sequences associated with combinatorial structures, Discrete Math., 59 (1986), pp. 135-166.
26. R. STANLEY, A symmetric function generalization of the chromatic polynomial of a graph, Adv. Math., 111 (1995), pp. 166-194.
27. R. STANLEY, Graph colorings and related symmetric functions: Ideas and applications, Discrete Math., to appear.
28. H. ZHOU, The chromatic difference sequence of the Cartesian product of graphs, Discrete Math., 90 (1991), pp. 297-311.
29. H. ZHOU, The chromatic difference sequence of the Cartesian product of graphs, Part II, Discrete Appl. Math., 41 (1993), pp. 263-267.
30. H. ZHOU, On the ultimate normalized chromatic difference sequences of graphs, Discrete Math., 148 (1996), pp. 287-297.
31. X. ZHU, On the bounds for the ultimate independence ratio of a graph, Discrete Math., 156 (1996), pp. 229-236.