scientific article; zbMATH DE number 3102314
From MaRDI portal
Publication:5837982
Cited in
(73)- Intersection graphs of k-uniform linear hypergraphs
- Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes
- Line hypergraphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Degree distribution and assortativity in line graphs of complex networks
- A note on co-maximal graphs of commutative rings
- Reconstructing a graph from its arc incidence graph
- CMMSE 18: geometric-arithmetic index and line graph
- Finding the root graph through minimum edge deletion
- Line graphs of monogenic semigroup graphs
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- Total domination on tree operators
- Characterizations of line graphs in signed and gain graphs
- Index of parameters of iterated line graphs
- Color-line and proper color-line graphs
- Constant threshold intersection graphs of orthodox paths in trees
- Line graph links
- Free fermions behind the disguise
- Sufficient conditions for a graph to be Hamiltonian
- Some observations on the smallest adjacency eigenvalue of a graph
- Relations between some topological indices and the line graph
- Hyperbolicity on graph operators
- On \(\bullet\)-line signed graphs \(L_\bullet(S)\)
- From finite line graphs to infinite derived signed graphs
- Distance-regular Cayley graphs with least eigenvalue \(-2\)
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- Characterization of classical graph classes by weighted clique graphs
- Zu einem Isomorphiesatz von H. Whitney für Graphen
- A characterization of clique graphs
- The staggered quantum walk model
- General sum-connectivity index of a graph and its line graph
- A comparison on metric dimension of graphs, line graphs, and line graphs of the subdivision graphs
- Miscellaneous digraph classes
- scientific article; zbMATH DE number 97635 (Why is no real title available?)
- The adjacency graphs of a complex
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- On the limit points of the smallest eigenvalues of regular graphs
- On the hardness of recognizing triangular line graphs
- Strictly Deza line graphs
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- On an edge partition and root graphs of some classes of line graphs
- Tree cover number and maximum semidefinite nullity of some graph classes
- Locally Finite Self-Interchange Graphs
- Recent Results on Hyperbolicity on Unitary Operators on Graphs
- Edge intersection graphs of linear 3-uniform hypergraphs
- Edge intersection graphs of linear 3-uniform hypergraphs
- scientific article; zbMATH DE number 7687414 (Why is no real title available?)
- Minimum weighted clique cover on claw‐free perfect graphs
- General Randić indices of a graph and its line graph
- New results and open problems in line graphs
- A dynamic algorithm for line graph recognition
- Incidence matrices and line graphs of mixed graphs
- Dominoes
- Tubings, chord diagrams, and Dyson-Schwinger equations
- On cycle graphs
- A characterization of the Grassmann graphs
- The differential on graph operator \(\mathrm{R}(G)\)
- A characterization of line graphs of directed graphs
- The edge-intersection graph of induced paths in a graph
- Recognizing signed line graphs with a single root
- Some spectral properties of oriented line graphs
- Forbidden induced subgraphs in iterative higher order line graphs
- On the double covers of a line graph
- On the degeneracy of spin ice graphs, and its estimate via the Bethe permanent
- On the total domination number of total graphs
- New conditions for graph Hamiltonicity
- Every 4-connected \{claw, hourglass\}-free graph is 2-Hamiltonian
- Correcting a graph into a linegraph minimizing Hamming distance edition is NP-complete and FPT by treewidth
- On the differential in central operator \(\mathcal{C} (G)\)
- Borel line graphs
- Some properties of line digraphs
- Relations between the general sum connectivity index and the line graph
- ILIGRA: an efficient inverse line graph algorithm
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 Q5837982)
