Structural Properties of Sparse Graphs

DOI10.1016/J.ENDM.2008.06.050MaRDI QIDQ5301017zbMATHOpenAlexFDO

Authors J. Nešetřil

Publication date 28 June 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.06.050

zbMATH Keywords

structural propertiessparse graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• Structural Properties of Sparse Graphs
• Structure in sparse \(k\)-critical graphs
• Sparsity. Graphs, structures, and algorithms
• Algorithmic properties of sparse digraphs
• Girth of sparse graphs
• Metrics for sparse graphs
• Sparse quasi-random graphs
• Characterizing Sparse Graphs by Map Decompositions
• Sparse graphs of high gonality
• Sparse graphs: metrics and random models

Cites work

• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1944144 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• A measure-theoretic approach to the theory of dense hypergraphs
• Combinatorial and computational aspects of graph packing and graph decomposition
• Counting graph homomorphisms
• 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
• On classes of relations and graphs determined by subobjects and factorobjects
• On nowhere dense graphs

Cited in

(3)

• Sparsity. Graphs, structures, and algorithms
• On sparse subgraphs preserving connectivity properties
• Metrics for 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 Q5301017)