A digraph represented by a family of boxes or spheres
From MaRDI portal
Publication:3344012
DOI10.1002/JGT.3190080312zbMATH Open0552.05030OpenAlexW2034342740MaRDI QIDQ3344012FDOQ3344012
Authors: H. Maehara 
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
Recommendations
- scientific article; zbMATH DE number 1043913
- Representing digraphs using intervals or circular arcs
- scientific article; zbMATH DE number 1693470
- scientific article; zbMATH DE number 5026365
- The separated box product of two digraphs
- scientific article; zbMATH DE number 1185583
- Box-Rectangular Drawings of Plane Graphs
- scientific article; zbMATH DE number 3046496
- scientific article; zbMATH DE number 4096394
- Box-rectangular drawings of planar graphs
Directed graphs (digraphs), tournaments (05C20) Other problems of combinatorial convexity (52A37) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Cites Work
Cited In (13)
- Cliques that are tolerance digraphs
- Characterizing the scale dimension of a high-dimensional classification problem
- On some subclasses of interval catch digraphs
- A characterization of interval catch digraphs
- Domination number of an interval catch digraph family and its use for testing uniformity
- Algorithms for interval catch digraphs
- A new family of proximity graphs: class cover catch digraphs
- On the complexity of directed intersection representation of DAGs
- On the intractability landscape of digraph intersection representations
- On the kernel and related problems in interval digraphs
- \(p\)-box: a new graph model
- Max point-tolerance graphs
- Representations of graphs and networks (coding, layouts and embeddings)
This page was built for publication: A digraph represented by a family of boxes or spheres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344012)
