A recognition algorithm for the total graphs
From MaRDI portal
Publication:4148016
DOI10.1002/net.3230080205zbMath0369.05048MaRDI QIDQ4148016
Publication date: 1978
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230080205
Related Items
An algorithm to recognize a middle graph, The total graph of a hypergraph, Approximation hardness of edge dominating set problems