Chromatic number of ISK4-free graphs

preprint2016arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Chromatic number of ISK4-free graphs

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0