On the linegraph of a directed-graph
From MaRDI portal
Publication:2527799
DOI10.1007/BF01110285zbMath0158.20901MaRDI QIDQ2527799
Publication date: 1967
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/170859
Related Items
Enriched line graph: a new structure for searching language collocations, Superconnected digraphs and graphs with small conditional diameters, Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs, Hamiltonian index of directed multigraph, Large \((d,D, D',s)\)-bipartite digraphs, On d-Fibonacci digraphs, Multipartite Moore digraphs, Diameter-vulnerability of large bipartite digraphs, On the super‐restricted arc‐connectivity of s ‐geodetic digraphs, Connectivity of large bipartite digraphs and graphs, On the restricted arc-connectivity of \(s\)-geodetic digraphs, Bipartite graphs and digraphs with maximum connectivity, Characterization of signed line digraphs, Line graphs for a multiplex network, Identifying codes in line digraphs, Restricted arc-connectivity of generalized \(p\)-cycles, Diameter vulnerability of GC graphs, On commutativity of two unary digraph operations: subdividing and line-digraphing, Heredity of the index of convergence of the line digraph, The underlying graph of a line digraph, Semigroups for flows in infinite networks, Diameter, short paths and superconnectivity in digraphs, A bibliography of graph equations, On the edges’ PageRank and line graphs, Kernels and partial line digraphs, Graph theory, About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs, Une démonstration du théorème de Dilworth et applications à un problème de couverture des graphes, Superconnectivity of bipartite digraphs and graphs, Hall exponents of matrices, tournaments and their line digraphs, Miscellaneous Digraph Classes, Review of properties of different precedence graphs for scheduling problems, A survey of line digraphs and generalizations, The superconnectivity of large digraphs and graphs, A Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸n, On the distance connectivity of graphs and digraphs
Cites Work
