The Chromatic Number of the Disjointness Graph of the Double Chain

被引：0

作者：

Fabila-Monroy, Ruy ^{[1
]}

Hidalgo-Toscano, Carlos ^{[2
]}

Leanos, Jesus ^{[3
]}

Lomeli-Haro, Mario ^{[4
]}

机构：

[1] Inst Politecn Nacl, Dept Matemat, Ctr Invest & Estudios Avanzados, Mexico City, DF, Mexico

[2] Ctr Invest & Innovac Tecnol Informac & Comunicac, Mexico City, DF, Mexico

[3] Univ Autonoma Zacatecas, Unidad Acad Matemat, Zacatecas, Zacatecas, Mexico

[4] Univ Autonoma San Luis Potosi, Inst Fis, San Luis Potosi, San Luis Potosi, Mexico

来源：

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE | 2020年 / 22卷 / 01期

基金：

芬兰科学院;

关键词：

chromatic number; double chain; edge disjointness graph; TRIANGULATIONS; BOUNDS;

D O I：

10.23638/DMTCS-22-1-11

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Let P be a set of n >= 4 points in general position in the plane. Consider all the closed straight line segments with both endpoints in P. Suppose that these segments are colored with the rule that disjoint segments receive different colors. In this paper we show that if P is the point configuration known as the double chain, with k points in the upper convex chain and l >= k points in the lower convex chain, then k + l - left perpendicular root 2l + 1/4 - 1/2 right perpendicular colors are needed and that this number is sufficient.

引用

页数：10

共 50 条

[41] Optimization of eigenvalue bounds for the independence and chromatic number of graph powers [J].

Abiad, A. ;

Coutinho, G. ;

Fiol, M. A. ;

Nogueira, B. D. ;

Zeijlemaker, S. .

DISCRETE MATHEMATICS, 2022, 345 (03)

[42] Chromatic Number of Fuzzy Graphs: Operations, Fuzzy Graph Coloring, and Applications [J].

Gong, Zengtai ;

Zhang, Jing .

AXIOMS, 2022, 11 (12)

[43] On large subgraphs of a distance graph which have small chromatic number [J].

A. A. Kokotkin .

Mathematical Notes, 2014, 96 :298-300

[44] Computing the chromatic number using graph decompositions via matrix rank [J].

Jansen, Bart M. P. ;

Nederlof, Jesper .

THEORETICAL COMPUTER SCIENCE, 2019, 795 :520-539

[45] New upper bound for the chromatic number of a random subgraph of a distance graph [J].

A. S. Gusev .

Mathematical Notes, 2015, 97 :326-332

[46] Maximum odd induced subgraph of a graph concerning its chromatic number [J].

Wang, Tao ;

Wu, Baoyindureng .

JOURNAL OF GRAPH THEORY, 2024, 107 (03) :578-596

[47] On large subgraphs of a distance graph which have small chromatic number [J].

Kokotkin, A. A. .

MATHEMATICAL NOTES, 2014, 96 (1-2) :298-300

[48] New upper bound for the chromatic number of a random subgraph of a distance graph [J].

Gusev, A. S. .

MATHEMATICAL NOTES, 2015, 97 (3-4) :326-332

[49] The chromatic number of the square of a Halin graph with maximum degree five is six [J].

Wang, Yiqiao ;

Hu, Xiaoxue ;

Wang, Weifan .

ARS COMBINATORIA, 2017, 133 :217-231

[50] Inequalities between strong, weak domination numbers and chromatic number of a graph [J].

Thangaraju, P. .

UTILITAS MATHEMATICA, 2018, 108 :221-229

← 1 2 3 4 5 →