Generalized Powers of Graphs and Their Algorithmic Use

DOI10.1007/11785293_39zbMath1141.05320OpenAlexW1906781644MaRDI QIDQ5757881

Chenyu Yan, Yang Xiang, Andreas Brandstädt, Feodor F. Dragan

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11785293_39

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Injective hulls of various graph classes ⋮ Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems ⋮ Finding clubs in graph classes ⋮ Graph classes with and without powers of bounded clique-width

This page was built for publication: Generalized Powers of Graphs and Their Algorithmic Use