Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
type: Item
instance of: scholarly article
title: Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
zbMATH Open document ID: 1221.05258
author: T. Karthick
author: S. A. Choudum
published in: Discrete Mathematics
publication date: 2010-10-28T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5807516
zbMATH Keywords: Chordal graphs
zbMATH Keywords: \(C_{4}\)-free graphs
zbMATH Keywords: maximal cliques
zbMATH Keywords: chromatic number
MaRDI profile type: Publication
full work available at URL: j.disc.2010.08.005
OpenAlex ID: W117829114
cites work: Dominating sets for split and bipartite graphs
cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\)
cites work: Q3025205
cites work: The strong perfect graph theorem
cites work: Triangulated neighborhoods in even-hole-free graphs
cites work: On diameters and radii of bridged graphs
cites work: Incidence matrices and interval graphs
cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
cites work: \(K_{1,3}\)-free and \(W_4\)-free graphs
cites work: A characterization of perfect graphs
cites work: Independent sets in extensions of 2\(K_{2}\)-free graphs
cites work: On cliques in graphs
cites work: Q4770411
cites work: Q4871056
cites work: Q5387691
cites work: Efficient graph representations
DOI: 10.1016/J.DISC.2010.08.005
description: scientific article; zbMATH DE number 5807516