Hostname: page-component-669899f699-b58lm Total loading time: 0 Render date: 2025-04-26T04:08:43.040Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on the conditional chromatic polynomial

Published online by Cambridge University Press:  18 May 2009

V. Voloshin
V. Voloshin
Affiliation:
Department of Mathematical Cybernetics, Moldova State University, Kishinev 277009, Moldova
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this note we consider a finite graph without loops and multiple edges. The colouring of a graph G in λ colours is the colouring of its vertices in such a way that no two of adjacent vertices have the same colours and the number of used colours does not exceed λ [1, 4]. Two colourings of graph G are called different if there exists at least one vertex which changes colour when passing from one colouring to another.

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 36 , Issue 3 , September 1994 , pp. 265 - 267
Copyright
Copyright © Glasgow Mathematical Journal Trust 1994

References

REFERENCES

1.Berge, C.. Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).Google Scholar
2.Voloshin, V.. Conditional chromatic polynomial. In Research on applied mathematics and informatics, Kishinev, Science, 1990, 16–19(in Russian).Google Scholar
3.Voloshin, V.. Conditional chromatic polynomial. In Methods and programs of resolving of optimization problems on graphs and networks. Part 1. Theses of reports (Novosibirsk, 1989 (in Russian)).Google Scholar
4.Zykov, A.. Fundamentals of graph theory (BCS Associates, Moscow, and Idaho USA, 1990).Google Scholar