scientific article; zbMATH DE number 1550912
From MaRDI portal
Publication:4523707
zbMATH Open0963.05002MaRDI QIDQ4523707FDOQ4523707
Authors: Wilfried Imrich, Sandi Klavžar 
Publication date: 14 January 2001
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- Constructing uniquely realizable graphs
- Optimal acyclic edge colouring of grid like graphs
- A local prime factor decomposition algorithm
- Computing median and antimedian sets in median graphs
- Quasi-independence, homology and the unity of type: a topological theory of characters
- A characterization of non-isometric binary words
- The fault-diameter of Cartesian products
- Two-ended regular median graphs
- Equitable colorings of Kronecker products of graphs
- Recognizing Cartesian products in linear time
- On direct product cancellation of graphs
- First and second extremal bipartite graphs with respect to PI index
- Isometric embedding of subdivided Connected graphs in the hypercube
- Isometric embeddings of subdivided complete graphs in the hypercube
- Approximate graph products
- Cage-amalgamation graphs, a common generalization of chordal and median graphs
- Multiple Kronecker covering graphs
- Products of unit distance graphs
- On the geodetic number and related metric sets in Cartesian product graphs
- Generalized symmetry of graphs - a survey
- \(\Theta\)-graceful labelings of partial cubes
- The \(t\)-median function on graphs
- Algorithm for recognizing Cartesian graph bundles
- Connectivity of strong products of graphs
- Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
- An oriented version of the 1-2-3 conjecture
- The algebra of metric betweenness. I: Subdirect representation and retraction
- On the roman domination in the lexicographic product of graphs
- Fault-diameter of Cartesian graph bundles
- The third and hyper-Zagreb coindices of some graph operations
- Embeddability of open-ended carbon nanotubes in hypercubes
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- Note on group distance magic graphs \(G[C_4]\)
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- Cops and an insightful robber
- Semi-Cartesian product of graphs
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
- An almost complete description of perfect codes in direct products of cycles
- The distinguishing number of Cartesian products of complete graphs
- On Cartesian products of signed graphs
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Computing the blocks of a quasi-median graph
- Isometric embeddings of subdivided connected graphs into hypercubes
- On the independence graph of a graph
- Visualization of quasi-median networks
- Atoms and clique separators in graph products
- On the Cartesian skeleton and the factorization of the strong product of digraphs
- Edge, vertex and mixed fault diameters
- The geodetic number of the lexicographic product of graphs
- Distance-residual subgraphs
- Title not available (Why is that?)
- The edge fault-diameter of Cartesian graph bundles
- Weak reconstruction of strong product graphs
- Homogeneous factorisations of graph products
- Quasi-median graphs, their generalizations, and tree-like equalities
- Matching extension in prism graphs
- Note on terminal-pairability in complete grid graphs
- Cartesian powers of graphs can be distinguished by two labels
- The property of \(k\)-colourable graphs is uniquely decomposable
- Disjoint dominating sets with a perfect matching
- Connectivity of Kronecker products by \(K_2\)
- Total coloring conjecture for certain classes of graphs
- Approximate eigensolution of Laplacian matrices for locally modified graph products
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- On path-pairability in the Cartesian product of graphs
- The behavior of clique-width under graph operations and graph transformations
- \(L(2,1)\)-labelings on the modular product of two graphs
- A combinatorial development of Fibonacci numbers in graph spectra
- Cartesian product graphs and k-tuple total domination
- \(1\)-perfectly orientable graphs and graph products
- Upper bounds on sets of orthogonal colorings of graphs
- Degree-based topological indices of double graphs and strong double graphs
- Fast recognition algorithms for classes of partial cubes
- Hedetniemi's conjecture and adjoint functors in thin categories
- Products of circulant graphs are metacirculant.
- On the super domination number of lexicographic product graphs
- On the weak Roman domination number of lexicographic product graphs
- Thinness of product graphs
- The 2-domination number of cylindrical graphs
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
- Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor
- The median function on graphs with bounded profiles
- Cycle frames and the Oberwolfach problem
- All good (bad) words consisting of 5 blocks
- On prisms, Möbius ladders and the cycle space of dense graphs
- Treewidth and logical definability of graph products
- PI polynomials of product graphs
- On the remoteness function in median graphs
- Corona graphs as a model of small-world networks
- On \(k\)-pairable regular graphs
- Boundary vertices of Cartesian product of directed graphs
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
- Cube intersection concepts in median graphs
- On subgraphs of Cartesian product graphs and S-primeness
- Title not available (Why is that?)
- Bounds for the pebbling number of product graphs
- Title not available (Why is that?)
- The distinguishing chromatic number of Cartesian products of two complete graphs
- On the eccentric complexity of graphs
- Lower bounds for treewidth of product 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 Q4523707)
