arXiv Open Access 2016

Chromatic number of ISK4-free graphs

Ngoc Khang Le

Lihat Sumber

Abstrak

A graph $G$ is said to be ISK4-free if it does not contain any subdivision of $K_4$ as an induced subgraph. In this paper, we propose new upper bounds for chromatic number of ISK4-free graphs and $\{$ISK4, triangle$\}$-free graphs.

Topik & Kata Kunci

cs.DM

Penulis (1)

Ngoc Khang Le

Format Sitasi

APA MLA BibTeX

Le, N.K. (2016). Chromatic number of ISK4-free graphs. https://arxiv.org/abs/1611.04279

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓