The following pages link to (Q3872508):
Displaying 50 items.
- Spanners of underlying graphs of iterated line digraphs (Q287078) (← links)
- Containment of butterflies in networks constructed by the line digraph operation (Q290188) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Semigroup approach to diffusion and transport problems on networks (Q512186) (← links)
- Infinite families of non-Cayley vertex-transitive tournaments (Q704285) (← links)
- Diameter, short paths and superconnectivity in digraphs (Q704288) (← links)
- Optimal constructions of reversible digraphs (Q801802) (← links)
- On hamiltonian line graphs and connectivity (Q803154) (← links)
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs (Q819766) (← links)
- Hamiltonicity of complements of middle graphs (Q870983) (← links)
- Asymptotic enumeration of N-free partial orders (Q913831) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- A note on certain de Bruijn sequences with forbidden subsequences (Q965982) (← links)
- On the determination problem for \(P_{4}\)-transformation of graphs (Q1015433) (← links)
- Diameter and connectivity of 3-arc graphs (Q1045140) (← links)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach (Q1057887) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- Line digraphs and the Moore-Penrose inverse (Q1149447) (← links)
- Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs (Q1161760) (← links)
- Connection digraphs and second-order line digraphs (Q1163029) (← links)
- A labeling algorithm to recognize a line digraph and output its root graph (Q1163377) (← links)
- On neighbourhood line graphs (Q1182866) (← links)
- On several symmetry conditions for graphs (Q1193428) (← links)
- The underlying graph of a line digraph (Q1199455) (← links)
- On a problem of walks (Q1296149) (← links)
- 9-connected claw-free graphs are Hamilton-connected (Q1305527) (← links)
- On induced subgraphs with odd degrees (Q1336646) (← links)
- \(n\)-dimensional line digraphs (Q1336657) (← links)
- The VC-dimension of set systems defined by graphs (Q1364472) (← links)
- Digraphs on permutations (Q1377815) (← links)
- Polyhedral characterizations and perfection of line graphs (Q1382259) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- On stable cutsets in line graphs (Q1400002) (← links)
- Heredity of the index of convergence of the line digraph (Q1414247) (← links)
- Independence and upper irredundance in claw-free graphs (Q1414584) (← links)
- Automorphism groups of \(k\)-arc transitive covers. (Q1422432) (← links)
- When a digraph and its line digraph are connected and cospectral (Q1584220) (← links)
- Line digraphs and coreflexive vertex sets (Q1584342) (← links)
- Isomorphisms of \(P_{k}\)-graphs for \(k \geqslant 4\) (Q1763336) (← links)
- On arc-regular permutation groups using Latin squares (Q1772214) (← links)
- Basic perfect graphs and their extensions (Q1779506) (← links)
- Essential edge connectivity of line graphs (Q1800416) (← links)
- Review of properties of different precedence graphs for scheduling problems (Q1847252) (← links)
- Line graphs and forbidden induced subgraphs (Q1850532) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Some inequalities for the first general Zagreb index of graphs and line graphs (Q2052243) (← links)
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (Q2082190) (← links)
- Enriched line graph: a new structure for searching language collocations (Q2128305) (← links)
- Telegraph systems on networks and port-Hamiltonians. II: Network realizability (Q2135779) (← links)
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\) (Q2146735) (← links)
