2001/01/01 by Wolfgang Espelage, Frank Gurski, Egon Wanke · 64 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Bipartite graph #Block graph #Bounded function #Chordal graph #Clique graph #Clique-width #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Graph #Graph power #Hamiltonian path #Induced path #Induced subgraph isomorphism problem #Interconnection Networks and Systems #Line graph #Longest path problem #Mathematics #Partition (number theory) #Pathwidth #Perfect graph #Time complexity #Voltage graph
paper · doi:10.1007/3-540-45477-2_12
published in Lecture Notes in Computer Science, 117-128 (Springer Berlin Heidelberg)
crossref issued 2001/01/01 · crossref published 2001/01/01 · crossref published-print 2001/01/01 · openalex publication_date 2001/01/01 · crossref published-online 2001/10/02 · crossref created 2007/08/16 · crossref deposited 2019/02/21 · openalex created_date 2025/10/10 · crossref indexed 2026/01/21 · openalex updated_date 2026/07/29