Structural Properties of Sparse Graphs

DOI10.1016/j.endm.2008.06.050zbMath1267.05221OpenAlexW4250531984MaRDI QIDQ5301017

Jaroslav 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A measure-theoretic approach to the theory of dense hypergraphs
• Combinatorial and computational aspects of graph packing and graph decomposition
• On classes of relations and graphs determined by subobjects and factorobjects
• 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 nowhere dense graphs

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