Separation dimension and degree

DOI10.1017/S0305004119000525zbMath1472.05114arXiv1811.08994OpenAlexW3104752240MaRDI QIDQ4958696

David R. Wood, Alexander D. Scott

Publication date: 14 September 2021

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.08994

zbMATH Keywords

maximum average degreestrongly separating representation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Coloring lines and Delaunay graphs with respect to boxes

Cites Work

• Unnamed Item
• Separation dimension of graphs and hypergraphs
• Boxicity of line graphs
• Frugal, acyclic and star colourings of graphs
• The induced separation dimension of a graph
• Asymptotically optimal frugal colouring
• On the dimensions of ordered sets of bounded degree
• Colouring a graph frugally
• Fractional and circular separation dimension of graphs
• The star arboricity of graphs
• Boxicity and Separation Dimension
• Separation Dimension of Bounded Degree Graphs
• Separation dimension and sparsity
• Circular Separation Dimension of a Subclass of Planar Graphs
• Better bounds for poset dimension and boxicity
• Probability and Computing