Back to Search Start Over

Chromatic Number of ISK4-Free Graphs.

Authors :
Le, Ngoc
Source :
Graphs & Combinatorics. Nov2017, Vol. 33 Issue 6, p1635-1646. 12p.
Publication Year :
2017

Abstract

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 the chromatic number of ISK4-free graphs and $$\{$$ ISK4, triangle $$\}$$ -free graphs. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
*SUBGRAPHS
*GRAPH theory
*GEOMETRIC vertices
*LOGICAL prediction
*JUDGMENT (Logic)

Details

Language :
English
ISSN :
09110119
Volume :
33
Issue :
6
Database :
Academic Search Index
Journal :
Graphs & Combinatorics
Publication Type :
Academic Journal
Accession number :
126308045
Full Text :
https://doi.org/10.1007/s00373-017-1860-x
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details