Bounds on half graph orders in powers of sparse graphs

DOI10.1007/978-3-030-83823-2_39MaRDI QIDQ6604703zbMATH OpenFDO

Authors Marek Sokołowski

Publication date 13 September 2024

Full work available at URL https://doi.org/10.1007/978-3-030-83823-2_39

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• Applications of a Planar Separator Theorem
• Characterising bounded expansion by neighbourhood complexity
• First order properties on nowhere dense structures
• Interpreting nowhere dense graph classes as a classical notion of model theory
• On the generalised colouring numbers of graphs that exclude a fixed minor
• Progressive algorithms for domination and independence
• Sparsity. Graphs, structures, and algorithms
• The Grad of a Graph and Classes with Bounded Expansion

This page was built for publication: Bounds on half graph orders in powers of sparse graphs

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