Separation dimension of graphs and hypergraphs

DOI10.1007/S00453-015-0050-6MaRDI QIDQ300474zbMATHOpenAlexFDO

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

zbMATH Keywords

line graphboxicityacyclic chromatic numberscrambling permutationseparation dimension

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Boxicity and separation dimension
• Separation dimension and sparsity
• Separation dimension and degree
• Separation dimension of bounded degree graphs
• Fractional and circular separation dimension of graphs

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 1303554 (Why is no real title available?)
• scientific article; zbMATH DE number 1420986 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 3307331 (Why is no real title available?)
• A note on scrambling permutations
• A special planar satisfiability problem and a consequence of its NP- completeness
• Boxicity and treewidth
• Boxicity of graphs on surfaces
• Boxicity of line graphs
• Boxicity of series-parallel graphs
• Concerning a Certain Set of Arrangements
• Dimensions of hypergraphs
• Extremal graphs of order dimension 4
• Interval representations of planar graphs
• Minimal scrambling sets of simple orders
• On acyclic colorings of graphs on surfaces
• On acyclic colorings of planar graphs
• On the order dimension of 1-sets versus \(k\)-sets
• Scrambling permutations and entropy of hypergraphs
• Separation dimension of bounded degree graphs
• Sequence covering arrays
• The book thickness of a graph
• The maximum number of edges in a graph of bounded dimension, with applications to ring theory

Cited in

(12)

• Induced separation dimension
• Separation dimension of bounded degree graphs
• Separation dimension and degree
• Vertex and edge dimension of hypergraphs
• Hypergraphs of Bounded Disjointness
• Fractional and circular separation dimension of graphs
• The induced separation dimension of a graph
• Separable and equatable hypergraphs
• Local boxicity and maximum degree
• Separation dimension and sparsity
• Perfect and nearly perfect separation dimension of complete and random graphs
• Boxicity and separation dimension

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)