On the hardness of recognizing triangular line graphs

DOI10.1016/j.disc.2011.11.037zbMath1408.68066arXiv1007.1178MaRDI QIDQ442382

J. Herrera, H. S. Yoon

Publication date: 10 August 2012

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

Full work available at URL: https://arxiv.org/abs/1007.1178

zbMATH Keywords

NP-completeness; H-line graph; triangular line graph

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C76: Graph operations (line graphs, products, etc.)