A max m,n algorithm for determining the graph H from its line graph G

1973/10/01 by N. Roussopoulos, Nicholas D. Roussopoulos · 7 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Combinatorics #Computer science #Graph #Graph Labeling and Dimension Problems #Graph algorithms #Interconnection Networks and Systems #Line graph #Mathematics

paper · doi:10.1016/0020-0190(73)90029-x

crossref issued 1973/10/01 · crossref published 1973/10/01 · crossref published-print 1973/10/01 · openalex publication_date 1973/10/01 · crossref created 2002/07/26 · crossref deposited 2019/04/12 · openalex created_date 2025/10/10 · crossref indexed 2026/02/28 · openalex updated_date 2026/07/23

Citations

• The interchange graph of a finite graph
• Depth-First Search and Linear Graph Algorithms
• Congruent Graphs and the Connectivity of Graphs

Cited by

• Dominoes
• Line graphs of bounded clique-width
• A dynamic algorithm for line graph recognition
• Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs
• Domination When the Stars Are Out
• An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem
• Line graph [wikipedia]