A note on chromatic number of (cap, even hole)-free graphs
type: Item
instance of: scholarly article
title: A note on chromatic number of (cap, even hole)-free graphs
zbMATH Open document ID: 1403.05053
author: Rong Wu
author: Baogang Xu
published in: Discrete Mathematics
publication date: 2019-01-22T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 7004818
zbMATH Keywords: induced even cycles
zbMATH Keywords: chromatic number
zbMATH Keywords: clique number
MaRDI profile type: Publication
full work available at URL: j.disc.2018.11.005
OpenAlex ID: W2904789974
cites work: Bisimplicial vertices in even-hole-free graphs
cites work: Structure and algorithms for (cap, even hole)-free graphs
cites work: The strong perfect graph theorem
cites work: Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
cites work: Even and odd holes in cap-free graphs
cites work: Q4500707
cites work: On rigid circuit graphs
cites work: Graph Theory and Probability
cites work: Q5749319
cites work: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
cites work: Q4484907
cites work: Induced subgraphs of graphs with large chromatic number. I. Odd holes
cites work: Alpha-balanced graphs and matrices and GF(3)-representability of matroids
cites work: Q5550921
cites work: Even-hole-free graphs: A survey
Wikidata QID: Q128750144
DOI: 10.1016/J.DISC.2018.11.005
description: scientific article; zbMATH DE number 7004818