On the Clique-Width of Perfect Graph Classes
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Block duplicate graphs and a hierarchy of chordal graphs
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
| Hi-index | 0.00 |
A chordal graph is called restricted unimodular if each cycle of its vertex-clique incidence bipartite graph has length divisible by 4. We characterize these graphs within all chordal graphs by forbidden induced subgraphs, by minimal relative separators, and in other ways. We show how to construct them by starting from block graphs and multiplying vertices subject to a certain restriction, which leads to a linear-time recognition algorithm. We show how they are related to other classes such as distance-hereditary chordal graphs and strongly chordal graphs. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 121–136, 1999