Connection digraphs and second-order line digraphs
From MaRDI portal
Publication:1163029
DOI10.1016/0012-365X(82)90147-9zbMath0483.05031OpenAlexW2043653823MaRDI QIDQ1163029
Lowell W. Beineke, Christina Maria Zamfirescu
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(82)90147-9
Related Items (15)
On the intractability landscape of digraph intersection representations ⋮ Recognizing interval digraphs and interval bigraphs in polynomial time ⋮ Short proofs for interval digraphs ⋮ Identifying codes in line digraphs ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ Classes of intersection digraphs with good algorithmic properties ⋮ Intersection representation of digraphs in trees with few leaves ⋮ A random intersection digraph: indegree and outdegree distributions ⋮ On the complexity of directed intersection representation of DAGs ⋮ Matching relations and the dimensional structure of social choices ⋮ Miscellaneous Digraph Classes ⋮ Line digraphs and coreflexive vertex sets ⋮ A survey of line digraphs and generalizations ⋮ An interval digraph in relation to its associated bipartite graph ⋮ Graphs and digraphs represented by intervals and circular arcs
Cites Work
This page was built for publication: Connection digraphs and second-order line digraphs
