On the hardness of recognizing triangular line graphs
type: Item
instance of: scholarly article
title: On the hardness of recognizing triangular line graphs
zbMATH Open document ID: 1408.68066
published in: Discrete Mathematics
publication date: 2012-08-10T00:00:00Z
full work available at URL: https://arxiv.org/abs/1007.1178
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C76
zbMATH DE Number: 6064680
zbMATH Keywords: triangular line graph
zbMATH Keywords: H-line graph
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
OpenAlex ID: W1991938654
arXiv ID: 1007.1178
cites work: Triangular line graphs and word sense disambiguation
cites work: Convergent sequences of iterated \(H\)-line graphs
cites work: Convergence of sequences of iterated triangular line graphs
cites work: Transitiv orientierbare Graphen
cites work: Reconstructing a graph from its arc incidence graph
cites work: Q4871174
cites work: Q5837982
cites work: Gallai and anti-Gallai graphs of a graph
cites work: Gallai graphs and anti-Gallai graphs
cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
cites work: Q4867717
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
DOI: 10.1016/J.DISC.2011.11.037
author: Pranav Anand
author: Henry Escuadro
author: Ralucca Gera
author: Stephen G. Hartke
author: Derrick Stolee
description: scientific article; zbMATH DE number 6064680