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.
A technique for reconstructing disconnected graphs
A theorem for an axiomatic approach to metric properties of graphs
A theorem on Hamiltonian line graphs
A viewpoint to the minimum coloring problem of hypergraphs
A visibility representation for graphs in three dimensions.
AB percolation: a brief survey
Adaptive identification in Torii in the King lattice.
Adjacency matrix equations and related problems: Research notes
Adomatic and idomatic numbers of graphs
Algebraic connectivity of graphs
Algebraic properties of edge ideals via combinatorial topology.
Algebraic properties of Husimi trees
Algorithm 36. Transitive closure of a graph
Algunos grafos compuestos.
From two graphs G1 and G2 on N1 and N2 vertices respectively, the compound graph G1[G2] on N1N2 vertices is obtained by connecting in some way N2 copies of G1.We present in this paper methods of compounding that result in families of graphs with large number of vertices for given values of the maximum degree ∆ and diameter D.
Alternating cycles and realizations of a degree sequence
An algorithm for optimal partitioning of a graph
An introduction to -graphs, a graph-theoretic representation of natural numbers.