On the existence of 1-factors in partial squares of graphs
On 2-cell embeddings of graphs with minimum numbers of regions
Edge-disjoint 1-factors in powers of connected graphs
On eulerian subgraphs of complementary graphs
An upper bound for the minimum degree of a graph
On a certain numbering of the vertices of a hypergraph
On locally quasiconnected graphs and their upper embeddability
A note on upper embeddable graphs
On 2-factors in squares of graphs
Hypergraphs and intervals
A generalization of Hamiltonian cycles for trees
Upper embeddable factorizations of graphs
A new characterization of the maximum genus of a graph
On pancyclic line graphs
Median graphs
A note on line graphs
A theorem on Hamiltonian line graphs
Graphic algebras
Planar permutation graphs of paths
An algebraic characterization of geodetic graphs
We say that a binary operation is associated with a (finite undirected) graph (without loops and multiple edges) if is defined on and if and only if , and for any , . In the paper it is proved that a connected graph is geodetic if and only if there exists a binary operation associated with which fulfils a certain set of four axioms. (This characterization is obtained as an immediate consequence of a stronger result proved in the paper).
Page 1 Next