Grad and classes with bounded expansion II. Algorithmic aspects

2007/04/17 by Jaroslav Nešetřil, Patrice Ossona de Mendez · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Bounded function #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Homomorphism #Limits and Structures in Graph Theory #Line graph #Mathematics #Pathwidth #Treewidth

paper · pdf · doi:10.1016/j.ejc.2006.07.014

openalex publication_date 2007/04/17 · crossref created 2007/04/17 · crossref issued 2008/04/01 · crossref published 2008/04/01 · crossref published-print 2008/04/01 · crossref deposited 2025/10/01 · openalex created_date 2025/10/10 · crossref indexed 2026/04/10 · openalex updated_date 2026/08/02

Citations

• S-functions for graphs
• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
• Graph minors. I. Excluding a forest
• Graph Minors. XVI. Excluding a non-planar graph
• Diameter and Treewidth in Minor-Closed Graph Families
• Über eine Eigenschaft der ebenen Komplexe
• Subgraph Isomorphism in Planar Graphs and Related Problems

Cited by

• Book embedding [wikipedia]