Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Matching, Rook and Chromatic Polynomials and Chromatically Vector Equivalent Graphs

E. J. Farrell1, Earl Glen Whitehead, Jr.2
1Department of Mathematics The University of the West Indies St. Augustine, Trinidad
2Department of Mathematics and Statistics University of Pittsburgh Pittsburgh, PA 15260, USA
  • Published: 30/04/1991

Abstract

It is shown that under certain conditions, the embeddings of chessboards in square boards, yield non-isomorphic associated graphs which have the same chro- matic polynomials. In some cases, sets of non-isomorphic graphs with this property are formed.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
E. J. Farrell, Earl Glen Whitehead, Jr.. Matching, Rook and Chromatic Polynomials and Chromatically Vector Equivalent Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 009. 107-118. DOI: .