ON GARLANDS IN χ-UNIQUELY COLORABLE GRAPHS

被引：0

作者：

Gein, P. A. ^{[1
]}

机构：

[1] Ural Fed Univ, 51 Lenina Ave, Ekaterinburg 62083, Russia

来源：

SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA | 2019年 / 16卷

关键词：

graph; complete multipartite graph; uniquely colorable graph; chromatic uniqueness; chromatic invartiant; CHROMATIC UNIQUENESS;

D O I：

10.33048/semi.2019.16.120

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph C is called chi-uniquely colorable, if all its chi-colorings induce the same partion of the vertex set into one-color components. For chi-uniquely colorable graphs new bound of the number of vertex set partions into chi + 1 cocliques is found.

引用

页码：1703 / 1715

页数：13

共 50 条

[1] UNIQUELY COLORABLE GRAPHS
BOLLOBAS, B
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 25 (01) : 54 - 61
[2] UNIQUELY COLORABLE PERFECT GRAPHS
TUCKER, A
[J]. DISCRETE MATHEMATICS, 1983, 44 (02) : 187 - 194
[3] Uniquely colorable graphs on surfaces
Matsumoto, Naoki
Noguchi, Kenta
[J]. ARS COMBINATORIA, 2014, 114 : 177 - 183
[4] UNIQUELY LINE COLORABLE GRAPHS
GREENWELL, DL
KRONK, HV
[J]. CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 1973, 16 (04): : 525 - 529
[5] Uniquely colorable Cayley graphs
Klotz, Walter
Sander, Torsten
[J]. ARS MATHEMATICA CONTEMPORANEA, 2017, 12 (01) : 155 - 165
[6] Uniquely　Tree　Colorable　Graphs
Deng Ping Department of Applied Mathematics
[J]. Railway Engineering Science, 1997, (01) : 90 - 95
[7] CRITICAL UNIQUELY COLORABLE GRAPHS
NESETRIL, J
[J]. ARCHIV DER MATHEMATIK, 1972, 23 (02) : 210 - &
[8] Uniquely total colorable graphs
Akbari, S
Behzad, M
Hajiabolhassan, H
Mahmoodian, ES
[J]. GRAPHS AND COMBINATORICS, 1997, 13 (04) : 305 - 314
[9] Uniquely Total Colorable Graphs
S. Akbari
M. Behzad
H. Hajiabolhassan
E. S. Mahmoodian
[J]. Graphs and Combinatorics, 1997, 13 : 305 - 314
[10] On uniquely list colorable graphs
Ghebleh, M
Mahmoodian, ES
[J]. ARS COMBINATORIA, 2001, 59 : 307 - 318

← 1 2 3 4 5 →