Retracts of strong products of graphs
From MaRDI portal
Publication:686295
DOI10.1016/0012-365X(92)90285-NzbMATH Open0780.05054OpenAlexW2006653924MaRDI QIDQ686295FDOQ686295
Sandi Klavžar, Wilfried Imrich
Publication date: 14 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90285-n
Recommendations
Cites Work
- Vertex-to-vertex pursuit in a graph
- Retracts of hypercubes
- Absolute planar retracts and the four colour conjecture
- Absolute Retracts and Varieties of Reflexive Graphs
- Title not available (Why is that?)
- Products of absolute retracts
- Title not available (Why is that?)
- Cardinal multiplication of structures with a reflexive relation
- The smallest graph variety containing all paths
- The smallest order variety containing all chains
- Title not available (Why is that?)
- Two remarks on retracts of graph products
- Retract rigid Cartesian products of graphs
Cited In (39)
- On the acyclic disconnection of multipartite tournaments
- Two remarks on retracts of graph products
- The Menger number of the Cartesian product of graphs
- Retract rigid Cartesian products of graphs
- The genus of the Gray graph is 7
- On Hadamard diagonalizable graphs
- On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs
- Hedetniemi's conjecture and the retracts of a product of graphs
- On geodesic structures of weakly median graphs. II: Compactness, the role of isometric rays
- Partial cubes: Structures, characterizations, and constructions
- Hyperplane arrangements in preference modeling
- The metric dimension of the lexicographic product of graphs
- Representation of Connected Monounary Algebras by Means of Irreducibles
- Strong products of \(\chi\)-critical graphs
- The tight span of an antipodal metric space. I: combinatorial properties
- On the geodesic pre-hull number of a graph
- Constructions of 1-uniform dcsl graphs using well-graded families of sets
- Title not available (Why is that?)
- Netlike partial cubes. I. General properties
- Strong products of Kneser graphs
- Pair lengths of product graphs
- On verifying and engineering the wellgradedness of a union-closed family
- Embedding graphs as isometric medians
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
- Title not available (Why is that?)
- Double graphs
- Cops and robbers from a distance
- Weak reconstruction of strong product graphs
- Media theory: Representations and examples
- The lattice dimension of a graph
- Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. I: Topologies and the geodesic convexity
- Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. II: Fixed subgraph properties and infinite treelike partial cubes
- On the extendability of certain semi-Cayley graphs of finite Abelian groups
- Idomatic partitions of direct products of complete graphs
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- Cubical token systems
- Homogeneous factorisations of complete multipartite graphs
- Distance monotonicity and a new characterization of Hamming graphs
- Coloring graph products---a survey
This page was built for publication: Retracts of strong products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686295)
