Duchet-type theorems for powers of HHD-free graphs

DOI10.1016/S0012-365X(96)00370-6zbMath0887.05050OpenAlexW2117307792MaRDI QIDQ1377865

Thomas Szymczak, Van Bang Le, Andreas Brandstädt

Publication date: 28 April 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00370-6

zbMATH Keywords

powers of graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Related Items (3)

Lexbfs-orderings and powers of hhd-free graphs^∗ ⋮ Maximum induced matching problem on hhd-free graphs ⋮ Induced Embeddings into Hamming Graphs.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak bipolarizable graphs
• Distances in cocomparability graphs and their powers
• On sources in comparability graphs, with applications
• \(r\)-dominating cliques in graphs with hypertree structure
• On powers of \(m\)-trapezoid graphs
• An nc algorithm to recognize hhd-free graphs
• Convexity and HHD-Free Graphs
• Powers of hhd-free graphs^∗

This page was built for publication: Duchet-type theorems for powers of HHD-free graphs