Clique neighborhoods and nearly chordal graphs

DOI10.1016/S0012-365X(96)00028-3zbMATH Open0880.05073MaRDI QIDQ1363699FDOQ1363699

Terry A. McKee

Publication date: 19 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

characterizationintersection graphchordal graphclique cover conditionclique intersection conditionneighborhood separator

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs
• The generating polynomial and Euler characteristic of intersection graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Graphs in which the neighborhoods of all vertices are clique extensions of grids
• Edge clique graphs and some classes of chordal graphs
• CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS

This page was built for publication: Clique neighborhoods and nearly chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363699)