built in a dxf file, 495.13mm x 371.34mm large, with 31.73mm margins on top and side, for the xochitl menubar.

Just for fun, here’s a reformulation of a famous conjecture in terms of the cartesian closed structure on the category of graphs. Hedetniemi’s conjecture says there’s no clever way of colouring a ...

Abstract: Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let G be a kG-connected graph and D_c(G) denote the diameter of G after deleting any of ...

Abstract: The characterization of graph morphisms in terms of the subgraphs of the Cartesian graph product is extended and used to develop algorithms for an optimal graph monomorphism problem. The ...