A Note On Graphs Representable As Product Graphs
A note on line colorings of cubic graphs
A note on line graphs
A note on outerplanarity of product graphs
A note on the computational complexity of computing the edge rotation distance between graphs
A note on the graph equation .
A note on the k-domination number of a graph.
A problem concerning -pancyclic graphs
A proof of the bounded graph conjecture.
A property of canonical graphs.
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
A recursive construction of asymmetric 1-factorisations.
A reformulation of matrix graph grammars with Boolean complexes.
A remark on cancellation in direct products of graphs
A remark on distances in products of graphs
A remark on graph operators
A theorem is proved which implies affirmative answers to the problems of E. Prisner. One problem is whether there are cycles of the line graph operator with period other than 1, the other whether there are cycles of the 4-edge graph operator with period greater than 2. Then a similar theorem follows.
A remark on signed posets and signed graphs
A Simple Proof of the Perfect Matching Theorem
A simple symmetry generating operads related to rooted planar -ary trees and polygonal numbers.
A tandem version of the cops and robber game played on products of graphs
In this version of the Cops and Robber game, the cops move in tandems, or pairs, such that they are at distance at most one from each other after every move. The problem is to determine, for a given graph G, the minimum number of tandems sufficient to guarantee a win for the cops. We investigate this game on three graph products, the Cartesian, categorical and strong products.