Maxclique and unit disk characterizations of strongly chordal graphs

DOI10.7151/dmgt.1757zbMath1305.05200OpenAlexW2145850404MaRDI QIDQ2509548

Pablo De Caria, Terry A. McKee

Publication date: 28 July 2014

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

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

zbMATH Keywords

cliquechordal graphstrongly chordal graphclosed neighborhoodmaxclique

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items

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

Cites Work

• Characterizations of strongly chordal graphs
• A new characterization of strongly chordal graphs
• Subgraph trees in graph theory
• The neighborhood characteristic parameter for graphs
• 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
• Dually Chordal Graphs
• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Unnamed Item
• Unnamed Item

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