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

classes of sparse graphsdensity of graphsgraph homomorphismsnowhere dense graphsshallow minors

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

(19)

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

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)