Structural Properties of Sparse Graphs

DOI10.1016/J.ENDM.2008.06.050zbMATH Open1267.05221OpenAlexW4250531984MaRDI QIDQ5301017FDOQ5301017

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

Recommendations

• Structural Properties of Sparse Graphs
• Structure in sparse \(k\)-critical graphs
• Sparsity. Graphs, structures, and algorithms
• scientific article; zbMATH DE number 7559155
• 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

zbMATH Keywords

structural propertiessparse graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Counting graph homomorphisms
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• A measure-theoretic approach to the theory of dense hypergraphs
• On nowhere dense graphs
• On classes of relations and graphs determined by subobjects and factorobjects
• Title not available (Why is that?)
• Combinatorial and computational aspects of graph packing and graph decomposition

Cited In (3)

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