The following pages link to (Q4523707):
Displaying 50 items.
- Visualization of quasi-median networks (Q642993) (← links)
- On prime inductive classes of graphs (Q648987) (← links)
- Approximate eigensolution of Laplacian matrices for locally modified graph products (Q654781) (← links)
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime (Q658020) (← links)
- State transfer on graphs (Q658029) (← links)
- Recognizing triangulated Cartesian graph products (Q658038) (← links)
- On idomatic partitions of direct products of complete graphs (Q659730) (← links)
- Connectivity of Kronecker products by \(K_2\) (Q659833) (← links)
- Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← links)
- Optimal acyclic edge colouring of grid like graphs (Q710564) (← links)
- On topological relaxations of chromatic conjectures (Q710730) (← links)
- Lower bounds for the domination number and the total domination number of direct product graphs (Q712256) (← links)
- On \(k\)-pairable regular graphs (Q712262) (← links)
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs (Q724854) (← links)
- On path-pairability in the Cartesian product of graphs (Q726652) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- Equitable colorings of Cartesian products of graphs (Q765364) (← links)
- On some topological indices of the tensor products of graphs (Q765370) (← links)
- Double domination in lexicographic product graphs (Q777395) (← links)
- Thinness of product graphs (Q831864) (← links)
- Edge, vertex and mixed fault diameters (Q840704) (← links)
- A note on adjacency preservers on Hermitian matrices over finite fields (Q841236) (← links)
- Fault-diameter of Cartesian graph bundles (Q845824) (← links)
- Minimum cycle bases of direct products of complete graphs (Q846010) (← links)
- Cartesian powers of graphs can be distinguished by two labels (Q854831) (← links)
- Hamilton cycles in digraphs of unitary matrices (Q856886) (← links)
- The \(t\)-median function on graphs (Q858309) (← links)
- Mutually embeddable graphs and the tree alternative conjecture (Q859614) (← links)
- Counting hypercubes in hypercubes (Q860462) (← links)
- On cube-free median graphs (Q864119) (← links)
- Fast recognition of classes of almost-median graphs (Q864135) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- Mobility of vertex-transitive graphs (Q864148) (← links)
- Weak reconstruction of strong product graphs (Q864154) (← links)
- An almost complete description of perfect codes in direct products of cycles (Q864867) (← links)
- Gridline indifference graphs (Q868216) (← links)
- Characterizing almost-median graphs (Q872051) (← links)
- Partial cubes and their \(\tau\)-graphs (Q875040) (← links)
- Hamming polynomials and their partial derivatives (Q875053) (← links)
- Maximal proper subgraphs of median graphs (Q878630) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- Products of digraphs and their competition graphs (Q907830) (← links)
- Multiple Kronecker covering graphs (Q925013) (← links)
- The PI index of product graphs (Q926779) (← links)
- Perfect codes in direct products of cycles-a complete characterization (Q931836) (← links)
- Homogeneous factorisations of graph products (Q932688) (← links)
- On the geodetic number of median graphs (Q941326) (← links)
- On the upper total domination number of Cartesian products of graphs (Q941836) (← links)
- Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs (Q944724) (← links)
- None of the coronoid systems can be isometrically embedded into a hypercube (Q948707) (← links)
