No article text was recorded for this version.
NP-hardness for perfect graphs
Version 1 of 110 papers23 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
- Blog: Clustering on k-Edge-Colored Graphs
- Blog: Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
- Blog: On the complexity of bicoloring clique hypergraphs of graphs
- Blog: Centroidal bases in graphs
- Blog: Algorithms for unipolar and generalized split graphs
- Blog: Resolvability of Hamming Graphs
- Blog: A Primal Approach to the Stable Set Problem
- Blog: Truncated metric dimension for finite graphs
- Blog: Metric Dimension
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_np_hardness_for_perfect_graphs_37ceb5ef,
title = {NP-hardness for perfect graphs},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/np-hardness-for-perfect-graphs/rdr_37ceb5efd65f4964a6dcf7be3a5bc8d0},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_np_hardness_for_perfect_graphs_37ceb5ef_v1,
title = {NP-hardness for perfect graphs},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/np-hardness-for-perfect-graphs/rdr_37ceb5efd65f4964a6dcf7be3a5bc8d0/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}