scientific article; zbMATH DE number 3675952
From MaRDI portal
Publication:3872508
Cited in
(71)- On endo-Cayley digraphs: the Hamiltonian property
- On commutativity of two unary digraph operations: subdividing and line-digraphing
- A note on certain de Bruijn sequences with forbidden subsequences
- Parallel \(N\)-free order recognition
- Line graphs for a multiplex network
- A labeling algorithm to recognize a line digraph and output its root graph
- Infinite families of non-Cayley vertex-transitive tournaments
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- A survey of line digraphs and generalizations
- Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
- Graphs with the unique path property: Structure, cycles, factors, and constructions
- The reformulated Sombor index of a graph
- Diameter, short paths and superconnectivity in digraphs
- Independence and upper irredundance in claw-free graphs
- On several symmetry conditions for graphs
- Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
- When a digraph and its line digraph are connected and cospectral
- VC-dimensions for graphs (extended abstract)
- Isomorphisms of \(P_{k}\)-graphs for \(k \geqslant 4\)
- Spanners of underlying graphs of iterated line digraphs
- On induced subgraphs with odd degrees
- Automorphism groups of k-arc transitive covers.
- Containment of butterflies in networks constructed by the line digraph operation
- Connection digraphs and second-order line digraphs
- Enriched line graph: a new structure for searching language collocations
- Incidence matrices and line graphs of mixed graphs
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
- On stable cutsets in line graphs
- On the determination problem for \(P_{4}\)-transformation of graphs
- Hamiltonicity of complements of middle graphs
- Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs
- On a problem of walks
- On hamiltonian line graphs and connectivity
- Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
- On arc-regular permutation groups using Latin squares
- The underlying graph of a line digraph
- Polyhedral characterizations and perfection of line graphs
- Some inequalities for the first general Zagreb index of graphs and line graphs
- Some transport and diffusion processes on networks and their graph realizability
- Semigroup approach to diffusion and transport problems on networks
- 9-connected claw-free graphs are Hamilton-connected
- Color-line and proper color-line graphs
- On \(\bullet\)-line signed graphs \(L_\bullet(S)\)
- n-dimensional line digraphs
- EVENT GRAPHS: ADVANCES AND APPLICATIONS OF SECOND-ORDER TIME-UNFOLDED TEMPORAL NETWORK MODELS
- Line graphs and forbidden induced subgraphs
- Essential edge connectivity of line graphs
- On neighbourhood line graphs
- Asymptotic enumeration of N-free partial orders
- Line digraphs and coreflexive vertex sets
- Diameter and connectivity of 3-arc graphs
- Heredity of the index of convergence of the line digraph
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- On the edges’ PageRank and line graphs
- A survey on conflict-free connection coloring of graphs
- Line digraphs and the Moore-Penrose inverse
- The VC-dimension of set systems defined by graphs
- The first zagreb index and some hamiltonian properties of the line graph of a graph
- Basic perfect graphs and their extensions
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- The structure and dynamics of networks with higher order interactions
- Optimal constructions of reversible digraphs
- Miscellaneous digraph classes
- Three-arc graphs: characterization and domination
- Review of properties of different precedence graphs for scheduling problems
- On stable cutsets in claw-free graphs and planar graphs
- Telegraph systems on networks and port-Hamiltonians. II: Network realizability
- Digraphs on permutations
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Bounds on the connectivity of iterated line graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3872508)
