scientific article; zbMATH DE number 851097
From MaRDI portal
Publication:4867717
Recommendations
Cited in
(85)- Dynamic graphs
- On expansive graphs
- The complexity of clique graph recognition
- Cube intersection concepts in median graphs
- Gallai graphs and anti-Gallai graphs
- Clique divergent graphs with unbounded sequence of diameters
- Recognizing clique graphs of directed and rooted path graphs
- The dynamics of the line and path graph operators
- Graph perturbations
- Dynamic graph models
- The forbidden minor characterization of line-search antimatroids of rooted digraphs
- Zero forcing in iterated line digraphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- The clique operator on cographs and serial graphs
- Dismantlings and iterated clique graphs
- Clique divergent clockwork graphs and partial orders
- Recognizing \(k\)-path graphs
- Searching for square-complementary graphs: complexity of recognition and further nonexistence results
- Total domination on tree operators
- On the clique behavior of graphs of low degree
- On bicliques and the second clique graph of suspensions
- An approximation algorithm for graph partitioning via deterministic annealing neural network
- Complexity functions for networks: dynamical hubs and complexity clusters
- Spectrum of anti-Gallai graph of some graphs
- The line completion number of hypercubes
- Hyperbolicity on graph operators
- On strong graph bundles
- On cliques and bicliques
- Gallai and anti-Gallai graph operators
- Edge contraction and edge removal on iterated clique graphs
- Graphs whose complement and square are isomorphic
- Characterization and recognition of generalized clique-Helly graphs
- The clique operator on graphs with few \(P_{4}\)'s
- Structural properties of word representable graphs
- Dynamic graph models and their properties
- On the clique behavior of circulants with three small jumps
- Dynamic Graphs in the Sliding-Window Model
- Induced cycles in triangle graphs
- Split clique graph complexity
- On the hyperbolicity of bipartite graphs and intersection graphs
- Communication cliques in mobile phone calling networks
- The dynamics of the forest graph operator
- Protean Graphs
- Histories in Path Graphs
- On neighborhood-Helly graphs
- Random Graphs, Retractions and Clique Graphs
- scientific article; zbMATH DE number 5778718 (Why is no real title available?)
- Split clique graph complexity
- On the hardness of recognizing triangular line graphs
- Characterizing 2-distance graphs
- Graph orientation and flows over time
- Characterization of super-radial graphs
- scientific article; zbMATH DE number 1406901 (Why is no real title available?)
- On the Steiner antipodal number of graphs
- On clique convergence of graphs
- Mycielskian of graphs with small game domination number
- Real subset sums and posets with an involution
- Weighted graphs as dynamical interaction systems
- The edge \(C_k\) graph of a graph
- On the radius of neighborhood graphs
- Harmonic evolutions on graphs
- scientific article; zbMATH DE number 2230239 (Why is no real title available?)
- Recent Results on Hyperbolicity on Unitary Operators on Graphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- Clique‐convergence is undecidable for automatic graphs
- Eccentric completion of a graph
- Diclique digraphs
- The Gallai and anti-Gallai graphs of strongly regular graphs
- Attractors points in the autosubstitution
- On cycle graphs
- Some inner metric parameters of a digraph: iterated line digraphs and integer sequences
- The differential on graph operator \(\mathrm{R}(G)\)
- Connectivity of 3-distance graphs
- Isomorphism of line graph and common neighbourhood graph
- Random walks and flights over connected graphs and complex networks
- The mincut graph of a graph
- Steiner radial number of generalized corona
- On the differential in central operator \(\mathcal{C} (G)\)
- Spectrum of Gallai graph of some graphs
- Generalized line graphs: Cartesian products and complexity of recognition
- Graph classes with and without powers of bounded clique-width
- On self-clique graphs with triangular cliques
- An infinite family of self-diclique digraphs
- Recognizing edge clique graphs among interval graphs and probe interval 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 Q4867717)
