A note on the conditional chromatic polynomial
Glasgow mathematical journal, Tome 36 (1994) no. 3, pp. 265-267

Voir la notice de l'article provenant de la source Cambridge University Press

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.
Voloshin, V. A note on the conditional chromatic polynomial. Glasgow mathematical journal, Tome 36 (1994) no. 3, pp. 265-267. doi: 10.1017/S0017089500030834
@article{10_1017_S0017089500030834,
     author = {Voloshin, V.},
     title = {A note on the conditional chromatic polynomial},
     journal = {Glasgow mathematical journal},
     pages = {265--267},
     year = {1994},
     volume = {36},
     number = {3},
     doi = {10.1017/S0017089500030834},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500030834/}
}
TY  - JOUR
AU  - Voloshin, V.
TI  - A note on the conditional chromatic polynomial
JO  - Glasgow mathematical journal
PY  - 1994
SP  - 265
EP  - 267
VL  - 36
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089500030834/
DO  - 10.1017/S0017089500030834
ID  - 10_1017_S0017089500030834
ER  - 
%0 Journal Article
%A Voloshin, V.
%T A note on the conditional chromatic polynomial
%J Glasgow mathematical journal
%D 1994
%P 265-267
%V 36
%N 3
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089500030834/
%R 10.1017/S0017089500030834
%F 10_1017_S0017089500030834

[1] 1.Berge, C.. Graphs and Hypergraphs (North-Holland, Amsterdam, 1973). Google Scholar

[2] 2.Voloshin, V.. Conditional chromatic polynomial. In Research on applied mathematics and informatics, Kishinev, Science, 1990, 16–19(in Russian). Google Scholar

[3] 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] 4.Zykov, A.. Fundamentals of graph theory (BCS Associates, Moscow, and Idaho USA, 1990). Google Scholar

Cité par Sources :