1994/08/01 by David Eppstein · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Arboricity #Bipartite graph #Bounded function #Combinatorics #Complete bipartite graph #Complexity and Algorithms in Graphs #Dense graph #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Induced subgraph #Line graph #Listing (finance) #Mathematics #Pathwidth #Planar graph #Upper and lower bounds #Vertex (graph theory)
paper · doi:10.1016/0020-0190(94)90121-x
crossref issued 1994/08/01 · crossref published 1994/08/01 · crossref published-print 1994/08/01 · openalex publication_date 1994/08/01 · crossref created 2002/07/26 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · crossref indexed 2026/07/09 · openalex updated_date 2026/07/23