Connection digraphs and second-order line digraphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3885939 (Why is no real title available?)
- scientific article; zbMATH DE number 3675952 (Why is no real title available?)
- scientific article; zbMATH DE number 3218572 (Why is no real title available?)
- scientific article; zbMATH DE number 3286813 (Why is no real title available?)
- Precedence Constraints and Arrow Diagrams
- Some properties of line digraphs
Cited in
(15)- An interval digraph in relation to its associated bipartite graph
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Short proofs for interval digraphs
- Line digraphs and coreflexive vertex sets
- On the complexity of directed intersection representation of DAGs
- On the intractability landscape of digraph intersection representations
- Identifying codes in line digraphs
- Graphs and digraphs represented by intervals and circular arcs
- Miscellaneous digraph classes
- Intersection representation of digraphs in trees with few leaves
- A survey of line digraphs and generalizations
- Graphs with the unique path property: Structure, cycles, factors, and constructions
- Classes of intersection digraphs with good algorithmic properties
- A random intersection digraph: indegree and outdegree distributions
- Matching relations and the dimensional structure of social choices
This page was built for publication: Connection digraphs and second-order line digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1163029)