Sparsity

2012/01/01 by Jaroslav Nešetřil, Patrice Ossona de Mendez, Jaroslav Nesetril · 16 citations
Computer Science · Engineering · Mathematics · #Advanced Algebra and Logic #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Graph theory and applications #graph theory and CDMA systems

paper · doi:10.1007/978-3-642-27875-4

crossref issued 2012/01/01 · crossref published 2012/01/01 · crossref published-print 2012/01/01 · openalex publication_date 2012/01/01 · crossref created 2012/04/23 · crossref deposited 2024/09/05 · openalex created_date 2025/10/10 · crossref indexed 2026/06/13 · openalex updated_date 2026/07/16

Citations

• Homomorphism preservation theorems

Cited by

• Twin-width II: small classes
• Stack-Number is Not Bounded by Queue-Number
• 1-Planar Graphs have Constant Book Thickness
• Deciding first-order properties of nowhere dense graphs
• On the Facial Thue Choice Index via Entropy Compression
• Planar graphs have bounded queue-number
• Beckman–Quarles theorem [wikipedia]
• Book embedding [wikipedia]
• Dense graph [wikipedia]
• Dilworth's theorem [wikipedia]
• Graph coloring [wikipedia]
• Graph minor [wikipedia]
• Grundy number [wikipedia]
• Induced path [wikipedia]
• Logic of graphs [wikipedia]
• Subgraph isomorphism problem [wikipedia]