Small graph classes and bounded expansion

DOI10.1016/J.JCTB.2009.06.001zbMath1216.05122OpenAlexW2140395242MaRDI QIDQ965245

Zdeněk Dvořák, Serguei Norine

Publication date: 21 April 2010

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2009.06.001

zbMATH Keywords

graphbounded expansionsmall graph classes

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (9)

Classes of graphs embeddable in order-dependent surfaces ⋮ Twin-width II: small classes ⋮ A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems ⋮ A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three ⋮ Random graphs from a weighted minor-closed class ⋮ Sublinear separators, fragility and subexponential expansion ⋮ On the purity of minor-closed classes of graphs ⋮ Random graphs containing few disjoint excluded minors ⋮ Chordal graphs with bounded tree-width

Cites Work

• The asymptotic number of labeled graphs with given degree sequences
• Random planar graphs
• Grad and classes with bounded expansion. I: Decompositions
• Grad and classes with bounded expansion. II: Algorithmic aspects
• Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
• Proper minor-closed families are small
• Linear time low tree-width partitions and algorithmic consequences
• Structural Properties of Sparse Graphs

This page was built for publication: Small graph classes and bounded expansion