Maxclique and unit disk characterizations of strongly chordal graphs

DOI10.7151/DMGT.1757MaRDI QIDQ2509548zbMATH OpenOpenAlexFDO

Authors Pablo De Caria, Terry A. McKee

Publication date 28 July 2014

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.1757

zbMATH Keywords

chordal graphcliqueclosed neighborhoodmaxcliquestrongly chordal graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• Strong clique trees, neighborhood trees, and strongly chordal graphs
• A characterization of strongly chordal graphs
• A new characterization of strongly chordal graphs
• Clique graph characterizations of strongly chordal graphs
• Characterizing and computing the structure of clique intersections in strongly chordal graphs

Cites work

• A new characterization of strongly chordal graphs
• Characterizations of strongly chordal graphs
• Dually Chordal Graphs
• Graph Classes: A Survey
• scientific article; zbMATH DE number 5532145 (Why is no real title available?)
• scientific article; zbMATH DE number 653261 (Why is no real title available?)
• On minimal vertex separators of dually chordal graphs: properties and characterizations
• On the correspondence between tree representations of chordal and dually chordal graphs
• Simplicial and nonsimplicial complete subgraphs
• Subgraph trees in graph theory
• The neighborhood characteristic parameter for graphs
• Topics in Intersection Graph Theory

Cited in

(2)

• Strongly unichord-free graphs
• Odd twists on strongly chordal graphs

This page was built for publication: Maxclique and unit disk characterizations of strongly chordal graphs

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