Powers of hhd-free graphs∗

DOI10.1080/00207169808804720zbMath1018.05092OpenAlexW2057188759MaRDI QIDQ4256126

Falk Nicolai, Feodor F. Dragan, Andreas Brandstädt

Publication date: 27 October 1999

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169808804720

zbMATH Keywords

chordal graphHHD-free graphpowers of graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (2)

Duchet-type theorems for powers of HHD-free graphs ⋮ Induced Embeddings into Hamming Graphs.

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• On powers and centers of chordal graphs
• Weak bipolarizable graphs
• On the semi-perfect elimination
• Powers of distance-hereditary graphs
• Triangulated graphs and the elimination process
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• An nc algorithm to recognize hhd-free graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Convexity and HHD-Free Graphs

This page was built for publication: Powers of hhd-free graphs^∗