Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A Note on Adjoint Polynomials and Uniquely Colorable Graphs

Haixing Zhao1, Ruying Liu 2
1Department of Computer Science and Engineering Northwestern Polytechnical University Xi’an, Shaanxi 710072, P. R. China
2Department of Mathematics, Qinghai Normal University Xining, Qinghai, 810008, P. R. China
  • Published: 31/05/2003

Abstract

In this note, we present many uniquely \(n\)-colorable graphs with \(m\) vertices and new constructing ways of uniquely colorable graphs by using the theory of adjoint polynomials of graphs. We give new constructing ways of two uniquely colorable graphs which are chromatically equivalent also.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Haixing Zhao, Ruying Liu . A Note on Adjoint Polynomials and Uniquely Colorable Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 045. 123-128. DOI: .