The generating polynomial and Euler characteristic of intersection graphs

DOI10.1016/0012-365X(94)90393-XzbMath0808.05044OpenAlexW2066943464MaRDI QIDQ1332411

Yeong-Nan Yeh

Publication date: 9 March 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90393-x

zbMATH Keywords

Euler characteristicintersection graphchordal graphsgenerating polynomialmolecular spacecontractible transformationsunit cubes in \(E^ n\)

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Clique neighborhoods and nearly chordal graphs ⋮ Strong homotopy induced by adjacency structure

Cites Work

• Unnamed Item
• On rigid circuit graphs
• Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs
• Minimal graphs of a torus, a projective plane and spheres and some properties of minimal graphs of homotopy classes
• Parallel concepts in graph theory
• On the global structure of crystalline surfaces
• Incidence matrices and interval graphs
• Generating projective plane polyhedral maps

This page was built for publication: The generating polynomial and Euler characteristic of intersection graphs