Maxclique and unit disk characterizations of strongly chordal graphs

DOI10.7151/DMGT.1757zbMATH Open1305.05200OpenAlexW2145850404MaRDI QIDQ2509548FDOQ2509548

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

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

zbMATH Keywords

cliquechordal graphstrongly chordal graphclosed neighborhoodmaxclique

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Characterizations of strongly chordal graphs
• On minimal vertex separators of dually chordal graphs: properties and characterizations
• On the correspondence between tree representations of chordal and dually chordal graphs
• Dually Chordal Graphs
• Title not available (Why is that?)
• A new characterization of strongly chordal graphs
• Subgraph trees in graph theory
• The neighborhood characteristic parameter for graphs
• Title not available (Why is that?)
• Simplicial and nonsimplicial complete subgraphs

Cited In (2)

• Odd twists on strongly chordal graphs
• Strongly unichord-free 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)