A digraph represented by a family of boxes or spheres
From MaRDI portal
Publication:3344012
DOI10.1002/jgt.3190080312zbMath0552.05030OpenAlexW2034342740MaRDI QIDQ3344012
Publication date: 1984
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190080312
Other problems of combinatorial convexity (52A37) Directed graphs (digraphs), tournaments (05C20) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Related Items (12)
Algorithms for interval catch digraphs ⋮ Max point-tolerance graphs ⋮ On some subclasses of interval catch digraphs ⋮ A characterization of interval catch digraphs ⋮ On the intractability landscape of digraph intersection representations ⋮ Cliques that are tolerance digraphs ⋮ On the kernel and related problems in interval digraphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ On the complexity of directed intersection representation of DAGs ⋮ A new family of proximity graphs: class cover catch digraphs ⋮ Domination number of an interval catch digraph family and its use for testing uniformity ⋮ Characterizing the scale dimension of a high-dimensional classification problem
Cites Work
This page was built for publication: A digraph represented by a family of boxes or spheres
