Хроматическая определяемость некоторых полных трехдольных графов. I
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 13 (2007) no. 3, pp. 65-83
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{TIMM_2007_13_3_a6,
author = {T. A. Koroleva},
title = {{\CYRH}{\cyrr}{\cyro}{\cyrm}{\cyra}{\cyrt}{\cyri}{\cyrch}{\cyre}{\cyrs}{\cyrk}{\cyra}{\cyrya} {\cyro}{\cyrp}{\cyrr}{\cyre}{\cyrd}{\cyre}{\cyrl}{\cyrya}{\cyre}{\cyrm}{\cyro}{\cyrs}{\cyrt}{\cyrsftsn} {\cyrn}{\cyre}{\cyrk}{\cyro}{\cyrt}{\cyro}{\cyrr}{\cyrery}{\cyrh} {\cyrp}{\cyro}{\cyrl}{\cyrn}{\cyrery}{\cyrh} {\cyrt}{\cyrr}{\cyre}{\cyrh}{\cyrd}{\cyro}{\cyrl}{\cyrsftsn}{\cyrn}{\cyrery}{\cyrh} {{\cyrg}{\cyrr}{\cyra}{\cyrf}{\cyro}{\cyrv}.~I}},
journal = {Trudy Instituta matematiki i mehaniki},
pages = {65--83},
year = {2007},
volume = {13},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TIMM_2007_13_3_a6/}
}
T. A. Koroleva. Хроматическая определяемость некоторых полных трехдольных графов. I. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 13 (2007) no. 3, pp. 65-83. http://geodesic.mathdoc.fr/item/TIMM_2007_13_3_a6/
[1] Asanov M. O., Baranskii V. A., Rasin V. V., Diskretnaya matematika: grafy, matroidy, algoritmy, NITs “Regulyarnaya i khaoticheskaya dinamika”, Izhevsk, 2001
[2] Baranskii V. A., Koroleva T. A., “Khromaticheskaya opredelyaemost atomov v reshetkakh polnykh mnogodolnykh grafov”, Tr. In-ta matematiki i mekhaniki UrO RAN, 13, no. 3, Ekaterinburg, 2007, 22–29
[3] Zhao H., Chromaticity and adjoint polynomials of graphs, Wöhrmann Print Service, Zutphen, 2005