Clique neighborhoods and nearly chordal graphs

DOI10.1016/S0012-365X(96)00028-3MaRDI QIDQ1363699zbMATHFDO

Authors 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)

Recommendations

• The neighborhood characteristic parameter for graphs
• Minimal separators of 2-chordal graphs
• Neighborhood perfect graphs
• Edge clique graphs and some classes of chordal graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3608075 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 653261 (Why is no real title available?)
• scientific article; zbMATH DE number 1011066 (Why is no real title available?)
• 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

Cited in

(5)

• Graphs in which the neighborhoods of all vertices are clique extensions of grids
• scientific article; zbMATH DE number 4114670 (Why is no real title available?)
• Edge clique graphs and some classes of chordal graphs
• CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS
• Clique vectors of \(k\)-connected chordal 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)