A max {m,n} algorithm for determining the graph H from its line graph G
- 31 October 1973
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 2 (4) , 108-112
- https://doi.org/10.1016/0020-0190(73)90029-x
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- The interchange graph of a finite graphActa Mathematica Hungarica, 1965
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932