On the public citation graph

Graph multiplication

0 signed · 298 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.21136/cpm.1958.108307openalex-snapshot

To the graph theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4814555openalex-extracted

Gallai's Path Decomposition Conjecture for Cartesian Product of Graphs (Ii)

inferred← citeshttps://doi.org/10.1002/9780470033326.refsopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1002/9781118032497.ch11openalex-snapshot

Constructions

inferred← citeshttps://doi.org/10.1002/cnm.1000openalex-snapshot

Topology and graph products; eigenproblems in optimal structural analysis

inferred← citeshttps://doi.org/10.1002/cnm.1269openalex-snapshot

Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models

inferred← citeshttps://doi.org/10.1002/cnm.753openalex-snapshot

A unified method for eigendecomposition of graph products

inferred← citeshttps://doi.org/10.1002/ijch.201400187openalex-snapshot

In silico Support for Eschenmoser’s Glyoxylate Scenario

inferred← citeshttps://doi.org/10.1002/jgt.10105openalex-snapshot

Large families of mutually embeddable vertex‐transitive graphs

inferred← citeshttps://doi.org/10.1002/jgt.20190openalex-snapshot

Distinguishing Cartesian powers of graphs

inferred← citeshttps://doi.org/10.1002/jgt.20385openalex-snapshot

Direct products of automorphism groups of graphs

inferred← citeshttps://doi.org/10.1002/jgt.20609openalex-snapshot

The Cartesian product of hypergraphs

inferred← citeshttps://doi.org/10.1002/jgt.22917openalex-snapshot

DP‐coloring Cartesian products of graphs

inferred← citeshttps://doi.org/10.1002/jgt.3190030402openalex-snapshot

A bibliography of graph equations

inferred← citeshttps://doi.org/10.1002/jgt.3190080113openalex-snapshot

Graphs with given group and given constant link

inferred← citeshttps://doi.org/10.1002/jgt.3190080407openalex-snapshot

Retracts of hypercubes

inferred← citeshttps://doi.org/10.1002/jgt.3190100406openalex-snapshot

Representing groups by graphs with constant link and hypergraphs

inferred← citeshttps://doi.org/10.1002/jgt.3190160508openalex-snapshot

Product graph representations

inferred← citeshttps://doi.org/10.1002/jgt.3190180604openalex-snapshot

Factoring cartesian‐product graphs

inferred← citeshttps://doi.org/10.1002/nme.1696openalex-snapshot

Block diagonalization of adjacency and Laplacian matrices for graph product; applications in structural mechanics

inferred← citeshttps://doi.org/10.1002/nme.2245openalex-snapshot

Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products

inferred← citeshttps://doi.org/10.1002/nme.2893openalex-snapshot

An efficient analysis of repetitive structures generated by graph products

inferred← citeshttps://doi.org/10.1006/eujc.2000.0401openalex-snapshot

Cartesian Products of Graphs and Metric Spaces

inferred← citeshttps://doi.org/10.1006/eujc.2000.0460openalex-snapshot

Complete Rotations in Cayley Graphs

inferred← citeshttps://doi.org/10.1006/jabr.2001.9126openalex-snapshot

Unique Tensor Factorization of Loop-Resistant Algebras over a Field of Finite Characteristic

inferred← citeshttps://doi.org/10.1006/jctb.1997.1746openalex-snapshot

Retracts of Infinite Hamming Graphs

inferred← citeshttps://doi.org/10.1007/11809678_38openalex-snapshot

Optimal Acyclic Edge Colouring of Grid Like Graphs

inferred← citeshttps://doi.org/10.1007/3-540-52292-1_2openalex-snapshot

Time bounds for broadcasting in bounded degree graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_19openalex-snapshot

On Cartesian Products of Signed Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-90199-8_25openalex-snapshot

On the Upper Bound of the Forwarding Index of Strong Product Networks

inferred← citeshttps://doi.org/10.1007/978-3-031-29126-5_2openalex-snapshot

Fault Diameter of Strong Product Graph of Two Paths

inferred← citeshttps://doi.org/10.1007/978-3-031-41420-6_77openalex-snapshot

Detection of TCC-Domination Number for Some Product Related Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-02429-5_1openalex-snapshot

Background

inferred← citeshttps://doi.org/10.1007/978-3-319-02964-1_9openalex-snapshot

Analysis of Regular Structures Using Graph Products

inferred← citeshttps://doi.org/10.1007/978-3-319-15010-9_6openalex-snapshot

Cartesian Products of Z-matrix Networks: Factorization and Interval Analysis

inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_20openalex-snapshot

Factorization of Cartesian Products of Hypergraphs

inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_23openalex-snapshot

Extension Properties of Boolean Contact Algebras

inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_42openalex-snapshot

A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product

inferred← citeshttps://doi.org/10.1007/978-3-7091-1565-7_3openalex-snapshot

Graph Products and Configuration Processing

inferred← citeshttps://doi.org/10.1007/978-3-7908-1808-6_2openalex-snapshot

Fuzzy Graphs

inferred← citeshttps://doi.org/10.1007/978-3-7908-1854-3_2openalex-snapshot

Fuzzy Graphs

inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_19openalex-snapshot

Vertex-Transitive Graphs That Are Not Cayley Graphs

inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_2openalex-snapshot

Exponentiation and Duality

inferred← citeshttps://doi.org/10.1007/978-94-015-1288-6_8openalex-snapshot

inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_5openalex-snapshot

Cayley graphs and interconnection networks

inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_8openalex-snapshot

Vertex-transitive graphs and digraphs

inferred← citeshttps://doi.org/10.1007/978-981-96-2830-8_4openalex-snapshot

Diagnosability of the Lexicographic Product of Paths and Complete Bipartite Graphs Under PMC Model

inferred← citeshttps://doi.org/10.1007/bf00396275openalex-snapshot

Powers of ordered sets

inferred← citeshttps://doi.org/10.1007/bf00396277openalex-snapshot

Unsolved problems

inferred← citeshttps://doi.org/10.1007/bf01200428openalex-snapshot

Cartesian graph factorization at logarithmic cost per edge

inferred← citeshttps://doi.org/10.1007/bf01201105openalex-snapshot

Automorphisms and products of ordered sets

inferred← citeshttps://doi.org/10.1007/bf01298284openalex-snapshot

On graphical regular representations of direct products of groups

inferred← citeshttps://doi.org/10.1007/bf01304186openalex-snapshot

Vertex-transitive graphs

inferred← citeshttps://doi.org/10.1007/bf01472575openalex-snapshot

Associative products of graphs

inferred← citeshttps://doi.org/10.1007/bf01818693openalex-snapshot

Über das lexikographische und das kostarke Produkt von Mengensystemen

inferred← citeshttps://doi.org/10.1007/bf01894629openalex-snapshot

Groups of graphs on given surfaces

inferred← citeshttps://doi.org/10.1007/bf01901750openalex-snapshot

A remark on contraction of graphs with given group

inferred← citeshttps://doi.org/10.1007/bf02017943openalex-snapshot

On automorphism groups of Cayley graphs

inferred← citeshttps://doi.org/10.1007/bf02020978openalex-snapshot

Über die starke Multiplikation von geordneten Graphen

inferred← citeshttps://doi.org/10.1007/bf02392038openalex-snapshot

Enumeration under two representations of the wreath product

inferred← citeshttps://doi.org/10.1007/bf02476692openalex-snapshot

Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs

inferred← citeshttps://doi.org/10.1007/bf02476948openalex-snapshot

Entropy and the complexity of graphs: I. An index of the relative complexity of a graph

inferred← citeshttps://doi.org/10.1007/bfb0037431openalex-snapshot

Recognizing graph products and bundles

inferred← citeshttps://doi.org/10.1007/bfb0059441openalex-snapshot

On the genus of products of graphs

inferred← citeshttps://doi.org/10.1007/bfb0070385openalex-snapshot

The cartesian product of two graphs is stable

inferred← citeshttps://doi.org/10.1007/bfb0071525openalex-snapshot

Composite graphs with edge stability index one

inferred← citeshttps://doi.org/10.1007/bfb0088911openalex-snapshot

A conjecture on two-point deleted subgraphs of cartesian products

inferred← citeshttps://doi.org/10.1007/bfb0097384openalex-snapshot

The stability index of the product of a path and a tree

inferred← citeshttps://doi.org/10.1007/jhep02(2022)104openalex-snapshot

Lattice fermions as spectral graphs

inferred← citeshttps://doi.org/10.1007/s00025-025-02381-xopenalex-snapshot

Virtual Motives for Synthetic Geometries, A. Definition and Properties of $$K_0(\mathcal {Q}_\ell )$$

inferred← citeshttps://doi.org/10.1007/s00026-019-00423-0openalex-snapshot

Generalised Paley Graphs with a Product Structure

inferred← citeshttps://doi.org/10.1007/s00037-021-00213-2openalex-snapshot

Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

inferred← citeshttps://doi.org/10.1007/s00224-016-9731-zopenalex-snapshot

Arithmetic for Rooted Trees

inferred← citeshttps://doi.org/10.1007/s00373-013-1392-yopenalex-snapshot

The Grid Property and Product-Like Hypergraphs

inferred← citeshttps://doi.org/10.1007/s00373-014-1414-4openalex-snapshot

Generalized Wreath Products of Graphs and Groups

inferred← citeshttps://doi.org/10.1007/s00373-017-1800-9openalex-snapshot

Covering Arrays on Product Graphs

inferred← citeshttps://doi.org/10.1007/s00373-018-1876-xopenalex-snapshot

Total Colorings of Product Graphs

inferred← citeshttps://doi.org/10.1007/s00707-009-0204-1openalex-snapshot

Improved group theoretic method using graph products for the analysis of symmetric-regular structures

inferred← citeshttps://doi.org/10.1007/s00707-010-0411-9openalex-snapshot

Analysis of space truss towers using combined symmetry groups and product graphs

inferred← citeshttps://doi.org/10.1007/s00707-011-0540-9openalex-snapshot

Laplacian matrices of product graphs: applications in structural mechanics

inferred← citeshttps://doi.org/10.1007/s10878-025-01266-7openalex-snapshot

The minimum orientable genus of the repeated Cartesian product of graphs

inferred← citeshttps://doi.org/10.1007/s10986-026-09716-3openalex-snapshot

On the subdirect product of graph bundles

inferred← citeshttps://doi.org/10.1007/s11786-012-0109-6openalex-snapshot

A Survey on Hypergraph Products

inferred← citeshttps://doi.org/10.1007/s11786-013-0156-7openalex-snapshot

Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs

inferred← citeshttps://doi.org/10.1007/s12190-021-01587-wopenalex-snapshot

On the resistance diameter of the Cartesian and lexicographic product of paths

inferred← citeshttps://doi.org/10.1007/s12190-025-02511-2openalex-snapshot

Optimal radio labeling of Cartesian product of rectangular mesh networks and stars

inferred← citeshttps://doi.org/10.1007/s40009-018-0642-1openalex-snapshot

Some Results on Tensor Product of a Graph and an Odd Cycle

inferred← citeshttps://doi.org/10.1007/s40819-019-0604-4openalex-snapshot

Boundary Vertices of Cartesian Product of Directed Graphs

inferred← citeshttps://doi.org/10.1007/s40840-023-01582-3openalex-snapshot

On the Metric Representation of the Vertices of a Graph

inferred← citeshttps://doi.org/10.1016/0012-365x(87)90104-xopenalex-snapshot

Counterexamples to two conjectures about distance sequences

inferred← citeshttps://doi.org/10.1016/0012-365x(92)90274-jopenalex-snapshot

Computing equivalence classes among the edges of a graph with applications

inferred← citeshttps://doi.org/10.1016/0012-365x(92)90280-sopenalex-snapshot

Finding the prime factors of strong direct product graphs in polynomial time

inferred← citeshttps://doi.org/10.1016/0012-365x(92)90283-lopenalex-snapshot

A note on Winkler's algorithm for factoring a connected graph

inferred← citeshttps://doi.org/10.1016/0012-365x(92)90298-topenalex-snapshot

Prefibers and the cartesian product of metric spaces

inferred← citeshttps://doi.org/10.1016/0012-365x(94)00298-wopenalex-snapshot

Lattices arising in categorial investigations of Hedetniemi's conjecture

inferred← citeshttps://doi.org/10.1016/0012-365x(95)00185-yopenalex-snapshot

On the weak reconstruction of Cartesian-product graphs

inferred← citeshttps://doi.org/10.1016/0020-0255(94)90116-3openalex-snapshot

Operations on fuzzy graphs

inferred← citeshttps://doi.org/10.1016/0024-3795(86)90235-1openalex-snapshot

Trivalent orbit polynomial graphs

inferred← citeshttps://doi.org/10.1016/0095-8956(71)90008-6openalex-snapshot

Über das schwache kartesische Produkt von Graphen

inferred← citeshttps://doi.org/10.1016/0095-8956(72)90030-5openalex-snapshot

On edge but not vertex transitive regular graphs

inferred← citeshttps://doi.org/10.1016/0095-8956(73)90013-0openalex-snapshot

Matroid basis graphs. II

inferred← citeshttps://doi.org/10.1016/0095-8956(74)90031-8openalex-snapshot

Eigenvalues of a graph and its imbeddings

inferred← citeshttps://doi.org/10.1016/0095-8956(74)90080-xopenalex-snapshot

Product graphs for given subgroups of the wreath product of two groups, I

inferred← citeshttps://doi.org/10.1016/0095-8956(74)90081-1openalex-snapshot

Independence numbers of product graphs

inferred← citeshttps://doi.org/10.1016/0095-8956(76)90006-xopenalex-snapshot

A polynomial dual of partitions

inferred← citeshttps://doi.org/10.1016/0095-8956(77)90010-7openalex-snapshot

Convex polyhedra of doubly stochastic matrices: II. Graph of

inferred← citeshttps://doi.org/10.1016/0095-8956(78)90002-3openalex-snapshot

Stability of cartesian products

inferred← citeshttps://doi.org/10.1016/0095-8956(83)90069-2openalex-snapshot

Prime interchange graphs of classes of matrices of zeros and ones

inferred← citeshttps://doi.org/10.1016/0095-8956(87)90018-9openalex-snapshot

Strict refinement for graphs and digraphs

inferred← citeshttps://doi.org/10.1016/0166-218x(85)90066-6openalex-snapshot

A polynomial time algorithm for finding the prime factors of cartesian-product graphs

inferred← citeshttps://doi.org/10.1016/0166-218x(86)90023-5openalex-snapshot

Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time

inferred← citeshttps://doi.org/10.1016/0890-5401(87)90063-0openalex-snapshot

Efficient fault-tolerant routings in networks

inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50029-4openalex-snapshot

10.1016/b978-044488002-4/50029-4

inferred← citeshttps://doi.org/10.1016/j.advengsoft.2014.09.017openalex-snapshot

Hypergraph products for structural mechanics

inferred← citeshttps://doi.org/10.1016/j.aim.2023.108887openalex-snapshot

Infinite quantum permutations

inferred← citeshttps://doi.org/10.1016/j.amc.2016.02.034openalex-snapshot

Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution

inferred← citeshttps://doi.org/10.1016/j.amc.2024.128645openalex-snapshot

On minimal directed strongly regular Cayley graphs over dihedral groups

inferred← citeshttps://doi.org/10.1016/j.amc.2024.128825openalex-snapshot

Extra connectivity of networks modeled by the strong product graphs

inferred← citeshttps://doi.org/10.1016/j.compstruc.2007.11.005openalex-snapshot

Graph products for configuration processing of space structures

inferred← citeshttps://doi.org/10.1016/j.dam.2007.06.006openalex-snapshot

Cancellation properties of products of graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.008openalex-snapshot

Graph products of the trivariate total domination polynomial and related polynomials

inferred← citeshttps://doi.org/10.1016/j.dam.2015.12.006openalex-snapshot

Estimation of Laplacian spectra of direct and strong product graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.022openalex-snapshot

Interval edge-colorings of composition of graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2018.12.023openalex-snapshot

Asymmetric colorings of products of graphs and digraphs

inferred← citeshttps://doi.org/10.1016/j.dam.2021.03.023openalex-snapshot

On Cartesian products of signed graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2023.04.019openalex-snapshot

Factorization and pseudofactorization of weighted graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2023.09.033openalex-snapshot

A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees

inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.016openalex-snapshot

Exact vertex forwarding index of the Strong product of complete graph and cycle

inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.041openalex-snapshot

Tight bounds on odd chromatic number of some standard graph products

inferred← citeshttps://doi.org/10.1016/j.disc.2005.09.038openalex-snapshot

Recognizing Cartesian products in linear time

inferred← citeshttps://doi.org/10.1016/j.disc.2005.09.049openalex-snapshot

Weak reconstruction of strong product graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2006.04.006openalex-snapshot

Pair lengths of product graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.029openalex-snapshot

Uniquely pairable graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.027openalex-snapshot

Generalized symmetry of graphs — A survey

inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.033openalex-snapshot

Optimal acyclic edge colouring of grid like graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2010.07.025openalex-snapshot

On k -pairable regular graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2011.02.016openalex-snapshot

A local prime factor decomposition algorithm

inferred← citeshttps://doi.org/10.1016/j.disc.2011.09.001openalex-snapshot

Regular embeddings of Cartesian product graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2013.01.006openalex-snapshot

On uniqueness of prime bipartite factors of graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.012openalex-snapshot

Unique square property, equitable partitions, and product-like graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2015.06.001openalex-snapshot

Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time

inferred← citeshttps://doi.org/10.1016/j.disc.2018.01.021openalex-snapshot

Cartesian products of directed graphs with loops

inferred← citeshttps://doi.org/10.1016/j.disc.2019.03.021openalex-snapshot

Arithmetical Semirings

inferred← citeshttps://doi.org/10.1016/j.disc.2022.112984openalex-snapshot

On distance-regular Cayley graphs of generalized dicyclic groups

inferred← citeshttps://doi.org/10.1016/j.disc.2026.115169openalex-snapshot

On the DP-chromatic number of Cartesian products of critical graphs

inferred← citeshttps://doi.org/10.1016/j.ejc.2004.02.010openalex-snapshot

Regular embeddings of complete multipartite graphs

inferred← citeshttps://doi.org/10.1016/j.ejc.2005.07.001openalex-snapshot

Cartesian powers of graphs can be distinguished by two labels

inferred← citeshttps://doi.org/10.1016/j.ejc.2008.09.006openalex-snapshot

Approximate graph products

inferred← citeshttps://doi.org/10.1016/j.ejc.2015.02.003openalex-snapshot

A prime factor theorem for bipartite graphs

inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.057openalex-snapshot

Behzad-Vizing conjecture and Cartesian product graphs

inferred← citeshttps://doi.org/10.1016/j.fiae.2015.09.005openalex-snapshot

Intuitionistic Fuzzy Graphs with Categorical Properties

inferred← citeshttps://doi.org/10.1016/j.finel.2009.02.001openalex-snapshot

Factorization of product graphs for partitioning and domain decomposition

inferred← citeshttps://doi.org/10.1016/j.jalgebra.2024.06.017openalex-snapshot

On an infinite family of integral Cayley graphs of Pauli groups

inferred← citeshttps://doi.org/10.1016/j.jcta.2008.02.008openalex-snapshot

Prime graphs and exponential composition of species

inferred← citeshttps://doi.org/10.1016/j.jcta.2019.105174openalex-snapshot

A classification of the graphical m-semiregular representation of finite groups

inferred← citeshttps://doi.org/10.1016/j.laa.2016.10.023openalex-snapshot

Wreath product of matrices

inferred← citeshttps://doi.org/10.1016/j.laa.2020.04.013openalex-snapshot

The energy of a simplicial complex

inferred← citeshttps://doi.org/10.1016/j.psra.2016.06.003openalex-snapshot

Properties of interval valued intuitionistic (S,T) – Fuzzy graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.006openalex-snapshot

Recognizing some complementary products

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.045openalex-snapshot

On the Cartesian skeleton and the factorization of the strong product of digraphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.038openalex-snapshot

Fast factorization of Cartesian products of (directed) hypergraphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.029openalex-snapshot

Direct product primality testing of graphs is GI-hard

inferred← citeshttps://doi.org/10.1016/j.topol.2022.108405openalex-snapshot

The digital Hopf construction

inferred← citeshttps://doi.org/10.1016/j.topol.2024.108892openalex-snapshot

Classical and digital homotopy classes

inferred← citeshttps://doi.org/10.1016/j.topol.2026.109947openalex-snapshot

Some properties of digital cofibrations in the sense of subdivision

inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00006-4openalex-snapshot

A fixed box theorem for the cartesian product of graphs and metric spaces

inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00242-7openalex-snapshot

Recognizing Cartesian graph bundles

inferred← citeshttps://doi.org/10.1016/s0012-365x(97)81051-5openalex-snapshot

Une caracterisation des produits d'arbres et des grilles

inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00069-7openalex-snapshot

Factoring cardinal product graphs in polynomial time

inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00003-3openalex-snapshot

Faithful 1-edge fault tolerant graphs

inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00095-1openalex-snapshot

Recognizing Hamming graphs in linear time and space

inferred← citeshttps://doi.org/10.1016/s0034-4877(18)30005-3openalex-snapshot

Quantum privacy and Schur product channels

inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00296-7openalex-snapshot

Algorithm for recognizing Cartesian graph bundles

inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00073-5openalex-snapshot

Constructing status injective graphs

inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70605-8openalex-snapshot

Cartesian Dimensions of a Graph

inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70890-2openalex-snapshot

The Problem of Fixed Points in Ordered Sets

inferred← citeshttps://doi.org/10.1016/s0195-6698(85)80049-4openalex-snapshot

Ramsey Properties for Classes of Relational Systems

inferred← citeshttps://doi.org/10.1016/s0195-6698(87)80012-4openalex-snapshot

Factoring a Graph in Polynomial Time

inferred← citeshttps://doi.org/10.1016/s0304-0208(01)80004-9openalex-snapshot

The Automorphism Group of a Graph

inferred← citeshttps://doi.org/10.1016/s0304-0208(01)80021-9openalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/s0304-0208(08)71373-2openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72907-4openalex-snapshot

Some remarks on focal graphs

inferred← citeshttps://doi.org/10.1016/s0893-9659(02)00042-3openalex-snapshot

Behzad-Vizing conjecture and Cartesian-product graphs

inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70380-5openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00111-8openalex-snapshot

Chromatic numbers of the strong product of odd cycles

inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00452-4openalex-snapshot

On the Weak Reconstruction of Strong Product Graphs

inferred← citeshttps://doi.org/10.1017/s000497271100219xopenalex-snapshot

A NOTE ON EDGE-CONNECTIVITY OF THE CARTESIAN PRODUCT OF GRAPHS

inferred← citeshttps://doi.org/10.1051/ro/2021192openalex-snapshot

Computing some role assignments of Cartesian product of graphs

inferred← citeshttps://doi.org/10.1051/ro/2023047openalex-snapshot

Computing role assignments of Cartesian product of graphs

inferred← citeshttps://doi.org/10.1061/(asce)st.1943-541x.0001512openalex-snapshot

Improved Symmetry Method for the Mobility of Regular Structures Using Graph Products

inferred← citeshttps://doi.org/10.1063/5.0234392openalex-snapshot

On dynamics of graph products

inferred← citeshttps://doi.org/10.1080/00207160108805092openalex-snapshot

An algorithm forK-convex closure and an application

inferred← citeshttps://doi.org/10.1080/01605682.2023.2290575openalex-snapshot

Games on graphs with coalitions

inferred← citeshttps://doi.org/10.1080/09728600.2023.2187960openalex-snapshot

Total colorings-a survey

inferred← citeshttps://doi.org/10.1080/16073606.1990.9631612openalex-snapshot

PRODUCTS OF CIRCULANT GRAPHS

inferred← citeshttps://doi.org/10.1080/17445760.2026.2613271openalex-snapshot

Radio labeling of strong prismatic network with star

inferred← citeshttps://doi.org/10.1088/1751-8113/47/37/375203openalex-snapshot

Resistance distances in composite graphs

inferred← citeshttps://doi.org/10.1090/s0002-9939-1970-0262116-3openalex-snapshot

The Automorphism Group of a Product of Graphs

inferred← citeshttps://doi.org/10.1090/tran/6714openalex-snapshot

The semigroup of metric measure spaces and its infinitely divisible probability measures

inferred← citeshttps://doi.org/10.1090/tran/8507openalex-snapshot

The geometry of diagonal groups

showing the first 200 of 297 · page through all 297

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.