On graphs without a \(C_{4}\) or a diamond
type: Item
instance of: scholarly article
title: On graphs without a \(C_{4}\) or a diamond
zbMATH Open document ID: 1213.05244
author: Elaine M. Eschen
author: Chính T. Hoàng
author: Jeremy P. Spinrad
author: R. Sritharan
published in: Discrete Applied Mathematics
publication date: 2011-04-19T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5880194
zbMATH Keywords: \(C_{4}\)-free graphs
zbMATH Keywords: diamond-free graphs
zbMATH Keywords: recognition algorithm
MaRDI profile type: Publication
full work available at URL: j.dam.2010.04.015
OpenAlex ID: W2144047548
cites work: Q5422499
cites work: Graph Classes: A Survey
cites work: Matrix multiplication via arithmetic progressions
cites work: A Linear Recognition Algorithm for Cographs
cites work: Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
cites work: On diameters and radii of bridged graphs
cites work: Algorithmic graph theory and perfect graphs
cites work: Q3943560
cites work: Computing independent sets in graphs with large girth
cites work: Efficient graph representations
DOI: 10.1016/J.DAM.2010.04.015
description: scientific article; zbMATH DE number 5880194