Structural Properties of Sparse Graphs

DOI10.1007/978-3-540-85221-6_13MaRDI QIDQ3601929zbMATH OpenOpenAlexFDO

Authors J. Nešetřil, P. Ossona de Mendez

Publication date 12 February 2009

Published in Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.2509

zbMATH Keywords

graph homomorphismsnowhere dense graphsshallow minorsdensity of graphsclasses of sparse graphs

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Structural characterization of families of graphs (05C75)

Recommendations

• Sparsity. Graphs, structures, and algorithms
• Algorithms for classes of graphs with bounded expansion
• Structural sparsity
• Sparse combinatorial structures: classification and applications
• Extremal problems for sparse graphs

Cited in

(18)

• Graph sharing games: complexity and connectivity
• Adapted game colouring of graphs
• On sparse subgraphs preserving connectivity properties
• Characterisations and examples of graph classes with bounded expansion
• Small graph classes and bounded expansion
• Colouring, constraint satisfaction, and complexity
• Sparsity. Graphs, structures, and algorithms
• Generalization of transitive fraternal augmentations for directed graphs and its applications
• Clustering powers of sparse graphs
• Structural sparsity
• Metrics for sparse graphs
• Equitable list tree-coloring of bounded treewidth graphs
• Rank-width and tree-width of \(H\)-minor-free graphs
• Algorithmic properties of sparse digraphs
• FPT algorithms for domination in sparse graphs and beyond
• Algorithms for classes of graphs with bounded expansion
• Extremal problems for sparse graphs
• Structural Properties of Sparse Graphs

This page was built for publication: Structural Properties of Sparse Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601929)