Graphs with no induced \(C_ 4\) and \(2K_ 2\)
type: Item
instance of: scholarly article
title: Graphs with no induced \(C_ 4\) and \(2K_ 2\)
zbMATH Open document ID: 0772.05082
DOI: 10.1016/0012-365X(93)90477-B
author: Mihály Hujter
author: András Pluhár
author: Zsolt Tuza
author: Zoltán Blázsik
published in: Discrete Mathematics
publication date: 1993-06-20T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 205589
zbMATH Keywords: Nordhaus-Gaddum theorem
zbMATH Keywords: induced subgraph
zbMATH Keywords: split graphs
zbMATH Keywords: clique
zbMATH Keywords: independent set
MaRDI profile type: Publication
cites work: Q4165164
cites work: Covering the cliques of a graph with vertices
cites work: Q5749319
cites work: On Complementary Graphs
cites work: Covering all cliques of a graph
cites work: A bound on the chromatic number of graphs without certain induced subgraphs
full work available at URL: 0012-365x(93)90477-b
OpenAlex ID: W179301118
description: scientific article; zbMATH DE number 205589