Separation dimension of graphs and hypergraphs
From MaRDI portal
Publication:300474
DOI10.1007/S00453-015-0050-6zbMATH Open1345.05067OpenAlexW1660733406MaRDI QIDQ300474FDOQ300474
Authors: Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
Publication date: 28 June 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0050-6
Recommendations
Cites Work
- On acyclic colorings of planar graphs
- Title not available (Why is that?)
- Interval representations of planar graphs
- The book thickness of a graph
- A special planar satisfiability problem and a consequence of its NP- completeness
- Boxicity and treewidth
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The maximum number of edges in a graph of bounded dimension, with applications to ring theory
- On the order dimension of 1-sets versus \(k\)-sets
- On acyclic colorings of graphs on surfaces
- Boxicity of graphs on surfaces
- Boxicity of series-parallel graphs
- Separation dimension of bounded degree graphs
- Boxicity of line graphs
- Title not available (Why is that?)
- Extremal graphs of order dimension 4
- A note on scrambling permutations
- Scrambling permutations and entropy of hypergraphs
- Title not available (Why is that?)
- Sequence covering arrays
- Minimal scrambling sets of simple orders
- Concerning a Certain Set of Arrangements
- Dimensions of hypergraphs
Cited In (12)
- Hypergraphs of Bounded Disjointness
- The induced separation dimension of a graph
- Separation dimension and degree
- Fractional and circular separation dimension of graphs
- Separable and equatable hypergraphs
- Perfect and nearly perfect separation dimension of complete and random graphs
- Boxicity and separation dimension
- Separation dimension of bounded degree graphs
- Local boxicity and maximum degree
- Vertex and edge dimension of hypergraphs
- Induced separation dimension
- Separation dimension and sparsity
This page was built for publication: Separation dimension of graphs and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300474)